3658 search results - page 557 / 732 » The logic of proofs, semantically |
180
click to vote
CSFW
1998
IEEE
15 years 10 months ago
1998
IEEE
In previous work [16], we give a type system that guarantees that well-typed multithreaded programs are possibilistically noninterfering. If thread scheduling is probabilistic, ho...
169
click to vote
PPDP
2000
Springer
15 years 10 months ago
2000
Springer
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...
165
click to vote
ZUM
2000
Springer
15 years 10 months ago
2000
Springer
The B-Method is a state-based formal method that describes behaviour in terms of MACHINES whose states change under OPERATIONS. The process algebra CSP is an event-based formalism ...
170
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
141
click to vote
ACTA
2010
15 years 6 months ago
2010
Abstract This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones...