4722 search results - page 530 / 945 » Encoding Program Executions |
121
click to vote
TACS
1991
Springer
15 years 8 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
122
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
153
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Guided Abstraction Simplification Roberto Giacobazzi1 and Francesco Ranzato2 1 University of Verona, Italy 2 University of Padova, Italy Abstract. In static analysis, approximation...
145
click to vote
LMO
1996
15 years 6 months ago
1996
We seek to support the development of open, distributed applications from patible software abstractions. In order to rigorously specify these abstractions, we are elaborating a for...
144
click to vote
ENTCS
2006
15 years 4 months ago
2006
In recent years, there has been increasing interest in computational models of biological systems based on various calculi of communicating processes, such as the stochastic pi-ca...