Sciweavers

6274 search results - page 120 / 1255
» Proofs, Programs, Processes
Sort
View
FAC
2000
94views more  FAC 2000»
15 years 2 months ago
Maximally Concurrent Programs
Typically, program design involves constructing a program P that implements a given specification S; that is, the set P of executions of P is a subset of the set S of executions s...
Rajeev Joshi, Jayadev Misra
LICS
2009
IEEE
15 years 9 months ago
Psi-calculi: Mobile Processes, Nominal Data, and Logic
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...
Jesper Bengtson, Magnus Johansson, Joachim Parrow,...
JMIV
2007
116views more  JMIV 2007»
15 years 2 months ago
Viscosity Solutions of a Level-Set Method for Anisotropic Geometric Diffusion in Image Processing
We discuss the existence of viscosity solutions for a class of anisotropic level-set methods which can be seen as an extension of the mean-curvature motion with a nonlinear anisot...
Tobias Preusser
POPL
2010
ACM
16 years 12 days ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
ENTCS
2007
101views more  ENTCS 2007»
15 years 3 months ago
Semantic Determinism and Functional Logic Program Properties
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
José Miguel Cleva, Francisco Javier L&oacut...