357 search results - page 47 / 72 » Specifying and Verifying Fault-Tolerant Systems |
ICFP
2000
ACM
14 years 1 days ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
ENTCS
2008
13 years 7 months ago
2008
We present the current state of our STSLib project. This project aims at defining an environment to formally specify and execute software components. One important feature is that...
CONCUR
2004
Springer
14 years 1 months ago
2004
Springer
We define a language whose type system, incorporating session types, allows complex protocols to be specified by types and verified by static typechecking. A session type, asso...
HYBRID
2010
Springer
14 years 2 months ago
2010
Springer
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...