Sciweavers

3342 search results - page 192 / 669
» Automating Abstract Interpretation
Sort
View
VMCAI
2009
Springer
15 years 6 months ago
SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
Abstract. We introduce Subpolyhedra (SubPoly) a new numerical abstract domain to infer and propagate linear inequalities. SubPoly is as expressive as Polyhedra, but it drops some o...
Vincent Laviron, Francesco Logozzo
XPU
2004
Springer
15 years 4 months ago
Putting a Motor on the Canoo WebTest Acceptance Testing Framework
Abstract. User acceptance testing is finally getting the attention and tool support it deserves. It is imperative that acceptance tests follow the best practices and embody the cri...
Jennitta Andrea
DATE
2009
IEEE
116views Hardware» more  DATE 2009»
15 years 6 months ago
A high-level debug environment for communication-centric debug
—A large part of a modern SOC’s debug complexity resides in the interaction between the main system components. ion-level debug moves the abstraction level of the debug process...
Kees Goossens, Bart Vermeulen, Ashkan Beyranvand N...
ENTCS
2007
86views more  ENTCS 2007»
14 years 11 months ago
Sequentiality and the CPS Semantics of Fresh Names
We investigate the domain-theoretic denotational semantics of a CPS with fresh name declaration. This is the target of a fully abstract CPS translation from the nu-calculus with ...
James Laird
TPHOL
2000
IEEE
15 years 3 months ago
Proof Terms for Simply Typed Higher Order Logic
Abstract. This paper presents proof terms for simply typed, intuitionistic higher order logic, a popular logical framework. Unification-based algorithms for the compression and re...
Stefan Berghofer, Tobias Nipkow