Sciweavers

4340 search results - page 291 / 868
» Formal Methods and Cryptography
Sort
View
IFM
2007
Springer
104views Formal Methods» more  IFM 2007»
16 years 1 months ago
Probabilistic Timed Behavior Trees
The Behavior Tree notation has been developed as a method for systematically and traceably capturing user requirements. In this paper we extend the notation with probabilistic beha...
Robert Colvin, Lars Grunske, Kirsten Winter
ISOLA
2007
Springer
16 years 1 months ago
Using Invariant Detection Mechanism in Black Box Inference
The testing and formal verification of black box software components is a challenging domain. The problem is even harder when specifications of these components are not available...
Muzammil Shahbaz, Roland Groz
SAS
2004
Springer
105views Formal Methods» more  SAS 2004»
16 years 12 days ago
Type Inference Against Races
Abstract. The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supp...
Cormac Flanagan, Stephen N. Freund
TYPES
2004
Springer
16 years 12 days ago
Tactic-Based Optimized Compilation of Functional Programs
Abstract Within a framework of correct code-generation from HOLspecifications, we present a particular instance concerned with the optimized compilation of a lazy language (called...
Thomas Meyer, Burkhart Wolff
FM
2003
Springer
112views Formal Methods» more  FM 2003»
16 years 8 days ago
Structuring Retrenchments in B by Decomposition
Simple retrenchment is briefly reviewed in the B language of J.-R. Abrial [1] as a liberalisation of classical refinement, for the formal description of application developments ...
Michael Poppleton, Richard Banach