Sciweavers

4341 search results - page 395 / 869
» Quantitative Model checking
Sort
View
ICLP
2005
Springer
16 years 10 days ago
Preference Reasoning
Abstract. Constraints and preferences are ubiquitous in real-life. Moreover, preferences can be of many kinds: qualitative, quantitative, conditional, positive or negative, to name...
Francesca Rossi
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 7 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
TACAS
2007
Springer
141views Algorithms» more  TACAS 2007»
16 years 28 days ago
JPF-SE: A Symbolic Execution Extension to Java PathFinder
We present JPF–SE, an extension to the Java PathFinder Model Checking framework (JPF) that enables the symbolic execution of Java programs. JPF–SE uses JPF to generate and expl...
Saswat Anand, Corina S. Pasareanu, Willem Visser
EPEW
2005
Springer
16 years 11 days ago
Executable Semantics for Compensating CSP
Compensation is an error recovery mechanism for long-running transactions. Compensating CSP is a variant of the CSP process algebra with constructs for orchestration of compensatio...
Michael J. Butler, Shamim Ripon
LICS
2002
IEEE
15 years 11 months ago
Temporal Logic with Forgettable Past
We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL + Past (which in turn can be more succinct than LTL). We ...
François Laroussinie, Nicolas Markey, Ph. S...