61 search results - page 4 / 13 » Partial Order Reduction for Rewriting Semantics of Programmi... |
ATVA
2006
Springer
14 years 8 days ago
2006
Springer
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
FOSSACS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
FM
2009
Springer
14 years 3 months ago
2009
Springer
Abstract: There is growing need to develop formal verification tools for Message Passing Interface (MPI) programs, to eliminate bugs such as deadlocks and local assertion violatio...
ICFP
2002
ACM
14 years 8 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
SDB
1995
14 years 2 days ago
1995
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...