811 search results - page 95 / 163 » Probabilistic Semantics and Program Analysis |
AMAST
2006
Springer
15 years 1 months ago
2006
Springer
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
100
click to vote
POPL
2012
ACM
13 years 5 months ago
2012
ACM
Formal models serve in many roles in the programming language community. In its primary role, a model communicates the idea of a language design; the architecture of a language to...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...
POPL
2010
ACM
15 years 4 months ago
2010
ACM
A fully automatic, compiler-driven approach to parallelisation can result in unpredictable time and space costs for compiled code. On the other hand, a fully manual approach to pa...
CHARME
2003
Springer
15 years 3 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...