Sciweavers

1133 search results - page 19 / 227
» Local Logics for Traces
Sort
View
JFPLC
2004
15 years 2 months ago
Explications pour comprendre la trace d'un solveur de contraintes sur domaines finis
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
92
Voted
ISSTA
2009
ACM
15 years 7 months ago
SideTrack: generalizing dynamic atomicity analysis
Atomicity is a key correctness specification for multithreaded programs. Prior dynamic atomicity analyses include precise tools, which report an error if and only if the observed...
Jaeheon Yi, Caitlin Sadowski, Cormac Flanagan
PLPV
2011
ACM
14 years 3 months ago
Local actions for a curry-style operational semantics
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
Gordon Stewart, Andrew W. Appel
111
Voted
SFM
2007
Springer
107views Formal Methods» more  SFM 2007»
15 years 6 months ago
A Survey of Markovian Behavioral Equivalences
Markovian behavioral equivalences are a means to relate and manipulate the formal descriptions of systems with an underlying CTMC semantics. There are three fundamental approaches ...
Marco Bernardo
99
Voted
FOSSACS
2000
Springer
15 years 4 months ago
On Recognizable Stable Trace Languages
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
Jean-François Husson, Rémi Morin