Sciweavers

2881 search results - page 306 / 577
» Model Checking for Programming Languages using Verisoft
Sort
View
CONCUR
2006
Springer
15 years 10 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
HICSS
2002
IEEE
132views Biometrics» more  HICSS 2002»
15 years 11 months ago
Modeling Current Events
Enormous amounts of information are produced every day, all over the world. but very little of it is true. In this paper, we describe the modeling component of a current events an...
Christopher Landauer, Kirstie L. Bellman
LOGCOM
1998
126views more  LOGCOM 1998»
15 years 6 months ago
Engineering AgentSpeak(L): A Formal Computational Model
Perhaps the most successful agent architectures, and certainly the best known, are those based on the Belief-Desire-Intention (BDI) framework. Despite the wealth of research that ...
Mark d'Inverno, Michael Luck
FPCA
1995
15 years 10 months ago
Once Upon a Type
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a typeinferenc...
David N. Turner, Philip Wadler, Christian Mossin
FMSD
2002
128views more  FMSD 2002»
15 years 6 months ago
Combining Software and Hardware Verification Techniques
Combining verification methods developed separately for software and hardware is motivated by the industry's need for a technology that would make formal verification of reali...
Robert P. Kurshan, Vladimir Levin, Marius Minea, D...