Sciweavers

3931 search results - page 433 / 787
» Separation logic and abstraction
Sort
View
IV
2005
IEEE
131views Visualization» more  IV 2005»
16 years 19 days ago
A Framework for Visualising Large Graphs
Visualising large graphs faces the challenges of both data complexity and visual complexity. This paper presents a framework for visualising large graphs that reduces data complex...
Wanchun Li, Seok-Hee Hong, Peter Eades
RTSS
2005
IEEE
16 years 19 days ago
Trading End-to-End Latency for Composability
The periodic resource model for hierarchical, compositional scheduling abstracts task groups by resource requirements. We study this model in the presence of dataflow constraints...
Slobodan Matic, Thomas A. Henzinger
CCS
2005
ACM
16 years 18 days ago
Formal security analysis of basic network-attached storage
We study formal security properties of network-attached storage (NAS) in an applied pi calculus. We model NAS as an implementation of a specification based on traditional central...
Avik Chaudhuri, Martín Abadi
ISCAS
2003
IEEE
135views Hardware» more  ISCAS 2003»
16 years 10 days ago
Formal verification of LTL formulas for SystemC designs
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
Daniel Große, Rolf Drechsler
HYBRID
2003
Springer
16 years 8 days ago
Model Checking LTL over Controllable Linear Systems Is Decidable
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
Paulo Tabuada, George J. Pappas