Sciweavers

117 search results - page 12 / 24
» Run-Time Bytecode Specialization
Sort
View
COMBINATORICS
2004
99views more  COMBINATORICS 2004»
13 years 9 months ago
A Fast Algorithm for MacMahon's Partition Analysis
This paper deals with evaluating constant terms of a special class of rational functions, the Elliott-rational functions. The constant term of such a function can be read off immed...
Guoce Xin
CPC
2000
93views more  CPC 2000»
13 years 9 months ago
Fast Unimodular Counting
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral ve...
John Mount
ECOOP
2001
Springer
14 years 2 months ago
An Overview of AspectJ
AspectJ™ is a simple and practical aspect-oriented extension to Java™. With just a few new constructs, AspectJ provides support for modular implementation of a range of crosscu...
Gregor Kiczales, Erik Hilsdale, Jim Hugunin, Mik K...
KBSE
2000
IEEE
14 years 2 months ago
Model Checking Programs
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
Willem Visser, Klaus Havelund, Guillaume P. Brat, ...
CORR
2011
Springer
115views Education» more  CORR 2011»
13 years 1 months ago
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amra...