Sciweavers

93 search results - page 11 / 19
» Partial Order Reduction for Model Checking of Timed Automata
Sort
View
TACAS
2010
Springer
181views Algorithms» more  TACAS 2010»
15 years 4 months ago
Boom: Taking Boolean Program Model Checking One Step Further
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
Gérard Basler, Matthew Hague, Daniel Kroeni...
ICFEM
2009
Springer
15 years 4 months ago
Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...
Anil Madhavapeddy
ICFEM
2009
Springer
15 years 4 months ago
Scalable Multi-core Model Checking Fairness Enhanced Systems
Rapid development in hardware industry has brought the prevalence of multi-core systems with shared-memory, which enabled the speedup of various tasks by using parallel algorithms....
Yang Liu 0003, Jun Sun 0001, Jin Song Dong
CL
2002
Springer
14 years 9 months ago
Orderly communication in the Ambient Calculus
The Ambient Calculus (henceforth, AC) was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code [9]. We present a type system for AC ...
Torben Amtoft, A. J. Kfoury, Santiago M. Peric&aac...
SEFM
2009
IEEE
15 years 4 months ago
Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for Interval Lengths
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...
Davide Bresolin, Valentin Goranko, Angelo Montanar...