Sciweavers

620 search results - page 86 / 124
» Abstract Analysis of Symbolic Executions
Sort
View
127
Voted
ENASE
2009
179views Hardware» more  ENASE 2009»
14 years 10 months ago
Evolving System's Modeling and Simulation through Reflective Petri Nets
Abstract. The design of dynamic discrete-event systems calls for adequate modeling formalisms and tools to manage possible changes occurring during system's lifecycle. A commo...
Lorenzo Capra, Walter Cazzola
ICST
2009
IEEE
14 years 10 months ago
Proving Functional Equivalence of Two AES Implementations Using Bounded Model Checking
Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...
Hendrik Post, Carsten Sinz
CADE
2011
Springer
14 years 17 days ago
Deciding Security for Protocols with Recursive Tests
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
110
Voted
ENDM
2010
86views more  ENDM 2010»
15 years 20 days ago
Mathematical programming based debugging
Verifying that a piece of software has no bugs means proving that it has certain desired properties, such as an array index not taking values outside certain Abstract interpretati...
Leo Liberti, Stéphane Le Roux, Jeremy Lecon...
ASWEC
2005
IEEE
15 years 6 months ago
A Formal Method for Program Slicing
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
Yingzhou Zhang, Baowen Xu, José Emilio Labr...