6274 search results - page 99 / 1255 » Proofs, Programs, Processes |
126
click to vote
ICFP
2004
ACM
15 years 12 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
UML
2000
Springer
15 years 3 months ago
2000
Springer
In this paper, dynamic meta modeling is proposed as a new approach to the operational semantics of behavioral UML diagrams. The dynamic meta model extends the well-known static met...
CORR
2002
Springer
14 years 11 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
196
click to vote
POPL
2004
ACM
16 years 6 days ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
FSTTCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programmi...