Sciweavers

321 search results - page 63 / 65
» Symbolic Model Checking for Probabilistic Timed Automata
Sort
View
CAV
2000
Springer
97views Hardware» more  CAV 2000»
13 years 10 months ago
Detecting Errors Before Reaching Them
Abstract. Any formalmethodor tool is almostcertainlymoreoftenapplied in situationswheretheoutcomeis failure(acounterexample)rather than success (a correctness proof). We present a ...
Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. ...
ICCAD
1995
IEEE
127views Hardware» more  ICCAD 1995»
13 years 9 months ago
Hybrid decision diagrams
Abstract: Functions that map boolean vectors into the integers are important for the design and veri cation of arithmetic circuits. MTBDDs and BMDs have been proposed for represent...
Edmund M. Clarke, Masahiro Fujita, Xudong Zhao
ERLANG
2008
ACM
13 years 7 months ago
Testing Erlang data types with quviq quickcheck
When creating software, data types are the basic bricks. Most of the time a programmer will use data types defined in library modules, therefore being tested by many users over ma...
Thomas Arts, Laura M. Castro, John Hughes
ASPLOS
2011
ACM
12 years 9 months ago
S2E: a platform for in-vivo multi-path analysis of software systems
This paper presents S2E, a platform for analyzing the properties and behavior of software systems. We demonstrate S2E’s use in developing practical tools for comprehensive perfo...
Vitaly Chipounov, Volodymyr Kuznetsov, George Cand...
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
13 years 11 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi