Sciweavers

58 search results - page 9 / 12
» Lexicographic Path Induction
Sort
View
POPL
2008
ACM
14 years 10 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
DATE
2002
IEEE
95views Hardware» more  DATE 2002»
14 years 2 months ago
Window-Based Susceptance Models for Large-Scale RLC Circuit Analyses
Due to the increasing operating frequencies and the manner in which the corresponding integrated circuits and systems must be designed, the extraction, modeling and simulation of ...
Hui Zheng, Lawrence T. Pileggi, Michael W. Beattie...
ICCAD
2002
IEEE
126views Hardware» more  ICCAD 2002»
14 years 2 months ago
Robust and passive model order reduction for circuits containing susceptance elements
Numerous approaches have been proposed to address the overwhelming modeling problems that result from the emergence of magnetic coupling as a dominant performance factor for ICs a...
Hui Zheng, Lawrence T. Pileggi
CADE
2010
Springer
13 years 11 months ago
Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
Brigitte Pientka, Joshua Dunfield
CIKM
2009
Springer
14 years 4 months ago
A query language for analyzing networks
With more and more large networks becoming available, mining and querying such networks are increasingly important tasks which are not being supported by database models and query...
Anton Dries, Siegfried Nijssen, Luc De Raedt