<--- Back to Details
First PageDocument Content
Formal methods / Theoretical computer science / Software engineering / Logic in computer science / Software development / Semigroup action / Refinement / Predicate transformer semantics / Program transformation / Postcondition / Finite-state machine / Formal verification
Date: 2012-08-02 20:33:11
Formal methods
Theoretical computer science
Software engineering
Logic in computer science
Software development
Semigroup action
Refinement
Predicate transformer semantics
Program transformation
Postcondition
Finite-state machine
Formal verification

Requirement Enforcement by Transformation Automata Douglas R. Smith Kestrel Institute 3260 Hillview Avenue Palo Alto, CaliforniaUSA

Add to Reading List

Source URL: www.kestrel.edu

Download Document from Source Website

File Size: 160,92 KB

Share Document on Facebook

Similar Documents

How to Twist Pointers without Breaking Them Satvik Chauhan ∗ Piyush P. Kurur  Brent A. Yorgey

How to Twist Pointers without Breaking Them Satvik Chauhan ∗ Piyush P. Kurur Brent A. Yorgey

DocID: 1rpNK - View Document

Microsoft PowerPoint - Presentationshaheen1.pptx

Microsoft PowerPoint - Presentationshaheen1.pptx

DocID: 1rn3C - View Document

Preliminaries  Known results on covers X -covers

Preliminaries Known results on covers X -covers

DocID: 1pClo - View Document

115  Doc. Math. J. DMV Semigroup Crossed Products and Hecke Algebras Arising from Number Fields

115 Doc. Math. J. DMV Semigroup Crossed Products and Hecke Algebras Arising from Number Fields

DocID: 1ppfA - View Document

115  Doc. Math. J. DMV Semigroup Crossed Products and Hecke Algebras Arising from Number Fields

115 Doc. Math. J. DMV Semigroup Crossed Products and Hecke Algebras Arising from Number Fields

DocID: 1p8Wh - View Document