- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering - SIGSOFT '04/FSE-12. - New York, New York, USA : ACM Press, 2004. - S. 201. - ISBN 1-58113-855-5
In: the 12th ACM SIGSOFT twelfth international symposium, 31. Okt 2004 - 6. Nov 2004, Newport Beach, CA, USA
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Konstanz
- (wer)
-
Bibliothek der Universität Konstanz
- (wann)
-
2008
- Urheber
- URN
-
urn:nbn:de:bsz:352-opus-57790
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:48 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Tan, Jianbin
- Avrunin, George S.
- Clarke, Lori A.
- Zilberstein, Shlomo
- Leue, Stefan
- Bibliothek der Universität Konstanz
Entstanden
- 2008
Ähnliche Objekte (12)
Protocol Verification with Heuristic Search
K<sup>⁎</sup> : A heuristic search algorithm for finding the k shortest paths
K* : heuristics-guided, on-the-fly k shortest paths search
Heuristic Search for Unbounded Executions
Extended Directed Search for Probabilistic Timed Reachability
Specifying Real-Time Requirements for SDL Specifications : A Temporal Logic-Based Approach
QoS Specification Based on SDL/MSC and Temporal Logic
Methods and semantics for telecommunications systems engineering
Directed and Heuristic Counterexample Generation for Probabilistic Model Checking - A Comparative Evaluation
Implementing Message Sequence Charts in Promela
Timing Constraints in Message Sequence Chart Specifications
Expressing and Analyzing Timing Constraints in Message Sequence Chart Specifications
Protocol Verification with Heuristic Search
K<sup>⁎</sup> : A heuristic search algorithm for finding the k shortest paths
K* : heuristics-guided, on-the-fly k shortest paths search
Heuristic Search for Unbounded Executions
Extended Directed Search for Probabilistic Timed Reachability
Specifying Real-Time Requirements for SDL Specifications : A Temporal Logic-Based Approach
QoS Specification Based on SDL/MSC and Temporal Logic
Methods and semantics for telecommunications systems engineering
Directed and Heuristic Counterexample Generation for Probabilistic Model Checking - A Comparative Evaluation
Implementing Message Sequence Charts in Promela
Timing Constraints in Message Sequence Chart Specifications
Expressing and Analyzing Timing Constraints in Message Sequence Chart Specifications
Protocol Verification with Heuristic Search
K<sup>⁎</sup> : A heuristic search algorithm for finding the k shortest paths
K* : heuristics-guided, on-the-fly k shortest paths search
Heuristic Search for Unbounded Executions
Extended Directed Search for Probabilistic Timed Reachability
Specifying Real-Time Requirements for SDL Specifications : A Temporal Logic-Based Approach
QoS Specification Based on SDL/MSC and Temporal Logic
Methods and semantics for telecommunications systems engineering
Directed and Heuristic Counterexample Generation for Probabilistic Model Checking - A Comparative Evaluation
Implementing Message Sequence Charts in Promela
Timing Constraints in Message Sequence Chart Specifications