1269 search results - page 160 / 254 » Pi-Calculus in Logical Form |
135
click to vote
ICFP
2003
ACM
16 years 5 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
119
click to vote
TACAS
2010
Springer
16 years 14 days ago
2010
Springer
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...
114
click to vote
DATE
2009
IEEE
16 years 7 days ago
2009
IEEE
—We investigate restructuring techniques based on decomposition/factorization, with the objective to move critical signals toward the output while minimizing area. A specific ap...
156
click to vote
CSL
2009
Springer
16 years 1 days ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
156
click to vote
TLCA
2009
Springer
16 years 16 hour ago
2009
Springer
The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly...