![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Maria Sorea
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [c16]Sebastian Voss, Maria Sorea, Klaus Echtle:
SAL-Based Symbolic Scheduling in Time-Triggered Networks. IFM 2009: 200-214 - 2008
- [c15]Michael Paulitsch, Harald Rueß, Maria Sorea:
Non-functional Avionics Requirements. ISoLA 2008: 369-384 - [c14]Maria Sorea, Bruno Dutertre, Wilfried Steiner:
Modeling and Verification of Time-Triggered Communication Protocols. ISORC 2008: 422-428 - 2006
- [c13]Christoph Heller, Josef Schalk, Stefan Schneele, Maria Sorea, Sebastian Voss:
Flexible Communication Architecture for Dependable Time-Triggered Systems. WADS 2006: 316-336 - 2005
- [c12]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, Germany, 2004, pp. 1- - [c11]Leonardo Mendonça de Moura, Sam Owre, Harald Rueß, John M. Rushby, Natarajan Shankar, Maria Sorea, Ashish Tiwari:
SAL 2. CAV 2004: 496-500 - [c10]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 - [c9]Bruno Dutertre, Maria Sorea:
Modeling and Verification of a Fault-Tolerant Real-Time Startup Protocol Using Calendar Automata. FORMATS/FTRTFT 2004: 199-214 - [c8]Maria Sorea:
Lazy Approximation for Dense Real-Time Systems. FORMATS/FTRTFT 2004: 363-378 - 2003
- [c7]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
- [c6]Leonardo Mendonça de Moura, Harald Rueß, Maria Sorea:
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains. CADE 2002: 438-455 - [c5]Maria Sorea:
A Decidable Fixpoint Logic for Time-Outs. CONCUR 2002: 255-271 - [c4]Maria Sorea:
Bounded Model Checking for Timed Automata. MTCS 2002: 116-134 - [c3]M. Oliver Möller, Harald Rueß, Maria Sorea:
Predicate Abstraction for Dense Real-Time System. Theory and Practice of Timed Systems @ ETAPS 2002: 218-237 - 2000
- [c2]Mila E. Majster-Cederbaum, Frank Salger, Maria Sorea:
A Priori Verification of Reactive Systems. FORTE 2000: 35-50
1990 – 1999
- 1997
- [c1]Martin Strecker, Maria Sorea:
Integrating an Equality Prover into a Software Development System Based on Type Theory. KI 1997: 147-158
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint