- CSB - MetaPress - Google - Bing - Yahoo
 | 2009 | |
|---|---|---|
| c14 |      | Sebastian Voss, Maria Sorea, Klaus Echtle: SAL-Based Symbolic Scheduling in Time-Triggered Networks. IFM 2009: 200-214 |
| 2008 | ||
| c13 | | Michael Paulitsch, Harald Rueß, Maria Sorea: Non-functional Avionics Requirements. ISoLA 2008: 369-384 |
| c12 | | Maria Sorea, Bruno Dutertre, Wilfried Steiner: Modeling and Verification of Time-Triggered Communication Protocols. ISORC 2008: 422-428 |
| 2006 | ||
| c11 | | Christoph Heller, Josef Schalk, Stefan Schneele, Maria Sorea, Sebastian Voss: Flexible Communication Architecture for Dependable Time-Triggered Systems. WADS 2006: 316-336 |
| 2005 | ||
| c10 | | Luca de Alfaro, Leandro Dias da Silva, Marco Faella, Axel Legay, Pritam Roy, Maria Sorea: Sociable Interfaces. FroCoS 2005: 81-105 |
| 2004 | ||
| b1 |  | Maria Sorea: Verification of real-time systems through lazy approximations. University of Ulm 2004, pp. 1- |
| c9 | | Leonardo Mendonça de Moura, Sam Owre, Harald Rueß, John M. Rushby, Natarajan Shankar, Maria Sorea, Ashish Tiwari: SAL 2. CAV 2004: 496-500 |
| c8 | | Wilfried Steiner, John M. Rushby, Maria Sorea, Holger Pfeifer: Model Checking a Fault-Tolerant Startup Algorithm: From Design Exploration To Exhaustive Fault Simulation. DSN 2004: 189-198 |
| c7 | | Bruno Dutertre, Maria Sorea: Modeling and Verification of a Fault-Tolerant Real-Time Startup Protocol Using Calendar Automata. FORMATS/FTRTFT 2004: 199-214 |
| c6 | | |
| 2003 | ||
| c5 | | Leonardo Mendonça de Moura, Harald Rueß, Maria Sorea: Bounded Model Checking and Induction: From Refutation to Verification (Extended Abstract, Category A). CAV 2003: 14-26 |
| 2002 | ||
| j2 | | M. Oliver Möller, Harald Rueß, Maria Sorea: Predicate Abstraction for Dense Real-Time System. Electr. Notes Theor. Comput. Sci. 65(6): 218-237 (2002) |
| j1 | | Maria Sorea: Bounded Model Checking for Timed Automata. Electr. Notes Theor. Comput. Sci. 68(5): 116-134 (2002) |
| c4 | | Leonardo Mendonça de Moura, Harald Rueß, Maria Sorea: Lazy Theorem Proving for Bounded Model Checking over Infinite Domains. CADE 2002: 438-455 |
| c3 | | |
| 2000 | ||
| c2 | | Mila E. Majster-Cederbaum, Frank Salger, Maria Sorea: A Priori Verification of Reactive Systems. FORTE 2000: 35-50 |
| 1997 | ||
| c1 | | Martin Strecker, Maria Sorea: Integrating an Equality Prover into a Software Development System Based on Type Theory. KI 1997: 147-158 |
Colors in the list of coauthors
Last update Mon May 20 01:38:35 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page