Sciweavers

2604 search results - page 340 / 521
» General constant expressions for system programming language...
Sort
View
SIGSOFT
2007
ACM
16 years 5 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
FASE
2004
Springer
15 years 8 months ago
Specification and Analysis of Real-Time Systems Using Real-Time Maude
Real-Time Maude is a language and tool supporting the formal specification and analysis of real-time and hybrid systems. The specification formalism is based on rewriting logic, em...
Peter Csaba Ölveczky, José Meseguer
SIGSOFT
2008
ACM
16 years 5 months ago
Alchemy: transmuting base alloy specifications into implementations
Alloy specifications are used to define lightweight models of systems. We present Alchemy, which compiles Alloy specifications into implementations that execute against persistent...
Shriram Krishnamurthi, Kathi Fisler, Daniel J. Dou...
ICFP
2004
ACM
16 years 4 months ago
Numbering matters: first-order canonical forms for second-order recursive types
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
François Pottier, Nadji Gauthier
86
Voted
ASPLOS
2006
ACM
15 years 10 months ago
Automatic generation of peephole superoptimizers
Peephole optimizers are typically constructed using human-written pattern matching rules, an approach that requires expertise and time, as well as being less than systematic at ex...
Sorav Bansal, Alex Aiken