Sciweavers

115 search results - page 2 / 23
» Verifying Probabilistic Procedural Programs
Sort
View
POPL
2012
ACM
12 years 1 months ago
A type theory for probability density functions
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
Sooraj Bhat, Ashish Agarwal, Richard W. Vuduc, Ale...
POPL
2009
ACM
14 years 7 months ago
Verifying liveness for asynchronous programs
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
PLDI
2009
ACM
14 years 7 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
VSTTE
2005
Springer
13 years 11 months ago
Decision Procedures for the Grand Challenge
Abstract. The Verifying Compiler checks the correctness of the program it compiles. The workhorse of such a tool is the reasoning engine, which decides validity of formulae in a su...
Daniel Kroening
HICSS
2003
IEEE
138views Biometrics» more  HICSS 2003»
13 years 11 months ago
Towards Verifying Parametrised Hardware Libraries with Relative Placement Information
Abstract— This paper presents a framework for verifying compilation tools for parametrised hardware libraries with placement information. Such libraries are captured in Pebble, a...
Steve McKeever, Wayne Luk, Arran Derbyshire