Sciweavers

7103 search results - page 790 / 1421
» Program Generation and Components
Sort
View
203
Voted
ICALP
2007
Springer
15 years 11 months ago
Affine Systems of Equations and Counting Infinitary Logic
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
Albert Atserias, Andrei A. Bulatov, Anuj Dawar
216
Voted
FM
2006
Springer
148views Formal Methods» more  FM 2006»
15 years 11 months ago
Automatic Translation from Circus to Java
Abstract. Circus is a combination of Z and CSP that supports the development of state-rich reactive systems based on refinement. In this paper we present JCircus, a tool that autom...
Angela Freitas, Ana Cavalcanti
ICALP
2000
Springer
15 years 11 months ago
A Matrix-based Method for Analysing Stochastic Process Algebras
This paper demonstrates how three stochastic process algebras can be mapped on to a generally-distributed stochastic transition system. We demonstrate an aggregation technique on ...
Jeremy T. Bradley, N. J. Davies
188
Voted
PLDI
1995
ACM
15 years 11 months ago
Storage Assignment to Decrease Code Size
DSP architectures typically provide indirect addressing modes with auto-increment and decrement. In addition, indexing mode is not available, and there are usually few, if any, ge...
Stan Y. Liao, Srinivas Devadas, Kurt Keutzer, Stev...
175
Voted
ICALP
1991
Springer
15 years 11 months ago
The Expected Extremes in a Delaunay Triangulation
We give an expected-case analysis of Delaunay triangulations. To avoid edge effects we consider a unit-intensity Poisson process in Euclidean d-space, and then limit attention to...
Marshall W. Bern, David Eppstein, F. Frances Yao