Sciweavers

923 search results - page 48 / 185
» Proving the value of formal methods
Sort
View
ICCAD
2007
IEEE
107views Hardware» more  ICCAD 2007»
16 years 3 months ago
Computation of minimal counterexamples by using black box techniques and symbolic methods
— Computing counterexamples is a crucial task for error diagnosis and debugging of sequential systems. If an implementation does not fulfill its specification, counterexamples ...
Tobias Nopper, Christoph Scholl, Bernd Becker
ESORICS
2000
Springer
15 years 9 months ago
Authentication and Confidentiality via IPSEC
The IP security protocols (IPsec) may be used via security gateways that apply cryptographic operations to provide security services to datagrams, and this mode of use is supported...
Joshua D. Guttman, Amy L. Herzog, F. Javier Thayer
ECBS
2010
IEEE
224views Hardware» more  ECBS 2010»
16 years 29 days ago
Timed Automata Model for Component-Based Real-Time Systems
—One of the key challenges in modern real-time embedded systems is safe composition of different software components. Formal verification techniques provide the means for design...
Georgiana Macariu, Vladimir Cretu
FM
2008
Springer
93views Formal Methods» more  FM 2008»
15 years 7 months ago
Finding Minimal Unsatisfiable Cores of Declarative Specifications
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
Emina Torlak, Felix Sheng-Ho Chang, Daniel Jackson
IFL
2000
Springer
15 years 9 months ago
Non-determinism Analysis in a Parallel-Functional Language
Abstract. The paper presents several analyses to detect non-deterministic expressions in the parallel-functional language Eden. First, the need for the analysis is motivated, and t...
Ricardo Pena, Clara Segura