Sciweavers

3713 search results - page 515 / 743
» Constructing a Calculus of Programs
Sort
View
TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
15 years 10 months ago
All-Termination(T)
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
Panagiotis Manolios, Aaron Turon
ICST
2009
IEEE
15 years 10 months ago
A Test-Driven Approach to Developing Pointcut Descriptors in AspectJ
Aspect-oriented programming (AOP) languages introduce new constructs that can lead to new types of faults, which must be targeted by testing techniques. In particular, AOP languag...
Romain Delamare, Benoit Baudry, Sudipto Ghosh, Yve...
TLCA
2009
Springer
15 years 10 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann
133
Voted
COMPSAC
2008
IEEE
15 years 9 months ago
A Component-Based Model and Language for Wireless Sensor Network Applications
Wireless sensor networks are often used by experts in many different fields to gather data pertinent to their work. Although their expertise may not include software engineering, ...
Alan Dearle, Dharini Balasubramaniam, Jonathan Lew...
204
Voted
HPDC
2008
IEEE
15 years 9 months ago
Harmony: an execution model and runtime for heterogeneous many core systems
The emergence of heterogeneous many core architectures presents a unique opportunity for delivering order of magnitude performance increases to high performance applications by ma...
Gregory F. Diamos, Sudhakar Yalamanchili