219 search results - page 4 / 44 » Bond-Free Languages: Formalizations, Maximality and Construc... |
JOT
2008
13 years 7 months ago
2008
Complex software systems possess concurrent and reactive behaviors requiring precise specifications prior to development. Lamport's transition axiom method is a formal specif...
ASWEC
2005
IEEE
14 years 1 months ago
2005
IEEE
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...
ICFEM
2000
Springer
13 years 11 months ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
SIGADA
2005
Springer
14 years 28 days ago
2005
Springer
The purpose of this research paper is to examine (1) why formal methods are required for software systems today; (2) the Praxis High Integrity Systems’ Correctness-by-Constructi...
COMPSAC
2002
IEEE
14 years 13 days ago
2002
IEEE
With computer systems becoming ever larger and more complex, the cost and effort associated with their construction is increasing and the systems are now sufficiently complex that...