Sciweavers

31387 search results - page 24 / 6278
» Abstracting abstract machines
Sort
View
JLP
2007
89views more  JLP 2007»
13 years 9 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker
ICCS
2003
Springer
14 years 3 months ago
A Parallel Virtual Machine for Bulk Synchronous Parallel ML
We have designed a functional data-parallel language called BSML for programming bulk-synchronous parallel (BSP) algorithms. The execution time can be estimated and dead-locks and ...
Frédéric Gava, Frédéri...
FMOODS
2007
13 years 11 months ago
Pict Correctness Revisited
The Pict programming language is an implementation of the π-calculus in which executions of π-calculus terms are specified via an abstract machine. An important property of any ...
Philippe Bidinger, Adriana B. Compagnoni
RP
2009
Springer
136views Control Systems» more  RP 2009»
14 years 2 months ago
Abstract Counterexamples for Non-disjunctive Abstractions
Counterexamples for Non-disjunctive ions K. L. McMillan1 and L. D. Zuck2 1 Cadence Research Labs 2 University of Illinois at Chicago Counterexample-guided abstraction refinement (...
Kenneth L. McMillan, Lenore D. Zuck