Sciweavers

11211 search results - page 1624 / 2243
» Rank-Sensitive Data Structures
Sort
View
CAV
2006
Springer
133views Hardware» more  CAV 2006»
15 years 11 months ago
Programs with Lists Are Counter Automata
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Ra...
CAV
2006
Springer
146views Hardware» more  CAV 2006»
15 years 11 months ago
Termination Analysis with Calling Context Graphs
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
Panagiotis Manolios, Daron Vroon
COMPLIFE
2006
Springer
15 years 11 months ago
Software Supported Modelling in Pharmacokinetics
A powerful new software concept to physiologically based pharmacokinetic (PBPK) modelling of drug disposition is presented. It links the inherent modular understanding in pharmacol...
Regina Telgmann, Max von Kleist, Wilhelm Huisinga
FGR
2004
IEEE
143views Biometrics» more  FGR 2004»
15 years 11 months ago
Video-Rate Capture of Dynamic Face Shape and Appearance
This paper presents a system for simultaneous capture of video sequences of face shape and colour appearance. Shape capture uses a projected infra-red structured light pattern tog...
Ioannis A. Ypsilos, Adrian Hilton, Simon Rowe
CONCUR
2006
Springer
15 years 11 months ago
A New Type System for Deadlock-Free Processes
We extend a previous type system for the -calculus that guarantees deadlock-freedom. The previous type systems for deadlockfreedom either lacked a reasonable type inference algorit...
Naoki Kobayashi
« Prev « First page 1624 / 2243 Last » Next »