Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6th ICTAC 2009: Kuala Lumpur, Malaysia
- Martin Leucker, Carroll Morgan:
Theoretical Aspects of Computing - ICTAC 2009, 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009. Proceedings. Lecture Notes in Computer Science 5684, Springer 2009, ISBN 978-3-642-03465-7
Invited Papers
- Zuohua Ding:
Static Analysis of Concurrent Programs Using Ordinary Differential Equations. 1-35 - Leslie Lamport:
The PlusCal Algorithm Language. 36-60 - Annabelle McIver
:
The Secret Art of Computer Programming. 61-78 - Sriram K. Rajamani:
Verification, Testing and Statistics. 79
Full Research Papers
- Massimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari, Roberto Zunino:
nu-Types for Effects and Freshness Analysis. 80-95 - Andreas Bauer, Rajeev Goré, Alwen Tiu:
A First-Order Policy Language for History-Based Transaction Monitoring. 96-111 - Nikola Benes, Jan Kretínský, Kim Guldstrand Larsen, Jirí Srba:
Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete. 112-126 - Jan A. Bergstra, Cornelis A. Middelburg:
Transmission Protocols for Instruction Streams. 127-139 - Gérard Boudol:
A Deadlock-Free Semantics for Shared Memory Concurrency. 140-154 - Cinzia Di Giusto, Jorge A. Pérez, Gianluigi Zavattaro:
On the Expressiveness of Forwarding in Higher-Order Communication. 155-169 - Volker Diekert, Steffen Kopecki, Victor Mitrana:
On the Hairpin Completion of Regular Languages. 170-184 - Zoltán Ésik, Szabolcs Iván:
Context-Free Languages of Countable Words. 185-199 - Stephen Fenech, Gordon J. Pace, Gerardo Schneider:
Automatic Conflict Detection on Contracts. 200-214 - Dario Fischbein, Víctor A. Braberman, Sebastián Uchitel:
A Sound Observational Semantics for Modal Transition Systems. 215-230 - Dag Hovland:
Regular Expressions with Numerical Constraints and Automata with Counters. 231-245 - Lakshmanan Kuppusamy, Kamala Krithivasan:
On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations. 246-260 - Delphine Longuet, Marc Aiguier:
Integration Testing from Structured First-Order Specifications via Deduction Modulo. 261-276 - Pham Ngoc Hung, Toshiaki Aoki, Takuya Katayama:
A Minimized Assumption Generation Method for Component-Based Software Verification. 277-291 - Pablo Rabanal, Ismael Rodríguez, Fernando Rubio:
A Formal Approach to Heuristically Test Restorable Systems. 292-306 - Tayssir Touili:
Constrained Reachability of Process Rewrite Systems. 307-321 - Margus Veanes, Nikolaj S. Bjørner:
Input-Output Model Programs. 322-335
Tool Papers
- Étienne André:
IMITATOR: A Tool for Synthesizing Constraints on Timing Bounds of Timed Automata. 336-342 - Hallstein Asheim Hansen, Gerardo Schneider:
GSPeeDI - A Verification Tool for Generalized Polygonal Hybrid Systems. 343-348 - Kazunori Ueda, Takayuki Ayano, Taisuke Hori, Hiroki Iwasawa, Seiji Ogawa:
Hierarchical Graph Rewriting as a Unifying Tool for Analyzing and Understanding Nondeterministic Systems. 349-355
a service of 
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.
last updated on 2023-03-26 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
