Sciweavers

718 search results - page 86 / 144
» Extraction of Structured Programs from Specification Proofs
Sort
View
IFIP
2010
Springer
13 years 3 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
ICSE
2003
IEEE-ACM
14 years 8 months ago
Scaling Step-Wise Refinement
Step-wise refinement is a powerful paradigm for developing a complex program from a simple program by adding features incrementally. We present the AHEAD (Algebraic Hierarchical Eq...
Don S. Batory, Jacob Neal Sarvela, Axel Rauschmaye...
RIAO
2000
13 years 10 months ago
Assisting requirements engineering with semantic document analysis
Requirements engineering is the first stage in the software life-cycle and is concerned with discovering and managing a software system's services, constraints and goals. Req...
Paul Rayson, Roger Garside, Peter Sawyer
IPL
2008
102views more  IPL 2008»
13 years 8 months ago
The connection between two ways of reasoning about partial functions
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
John S. Fitzgerald, Cliff B. Jones
ICSE
2010
IEEE-ACM
13 years 10 months ago
SMT-based bounded model checking for multi-threaded software in embedded systems
The transition from single-core to multi-core processors has made multi-threaded software an important subject over the last years in computer-aided verification. Model checkers ...
Lucas Cordeiro