3228 search results - page 197 / 646 » Computationally Sound Proofs |
149
click to vote
TASE
2008
IEEE
16 years 28 days ago
2008
IEEE
The WS-BPEL language has recently become a de facto standard for modeling Web-based business processes. One of its essential features is the fully programmable compensation mechan...
170
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
186
click to vote
ECOOP
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Component software means reuse and separate marketing of pre-manufactured binary components. This requires components from different vendors to be composed very late, pos...
186
click to vote
FTRTFT
1998
Springer
15 years 10 months ago
1998
Springer
PLC-Automata are a class of real-time automata suitable to describe the behavior of polling real-time systems. PLC-Automata can be compiled to source code for PLCs, a hardware wide...
145
click to vote
TAPSOFT
1997
Springer
15 years 10 months ago
1997
Springer
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...