Sciweavers

4940 search results - page 367 / 988
» On the Complexity of Universal Programs
Sort
View
ICFEM
2007
Springer
16 years 27 days ago
Model Checking with SAT-Based Characterization of ACTL Formulas
Bounded semantics of LTL with existential interpretation and that of ECTL (the existential fragment of CTL), and the characterization of these existentially interpreted properties ...
Wenhui Zhang
APLAS
2005
ACM
16 years 9 days ago
An Abstract Interpretation Perspective on Linear vs. Branching Time
act Interpretation Perspective on Linear vs. Branching Time Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy It is...
Francesco Ranzato, Francesco Tapparo
ICS
2001
Tsinghua U.
15 years 11 months ago
Optimizing strategies for telescoping languages: procedure strength reduction and procedure vectorization
At Rice University, we have undertaken a project to construct a framework for generating high-level problem solving languages that can achieve high performance on a variety of pla...
Arun Chauhan, Ken Kennedy
CCS
2006
ACM
15 years 10 months ago
A scalable approach to attack graph generation
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...
Xinming Ou, Wayne F. Boyer, Miles A. McQueen
ETS
2000
IEEE
156views Hardware» more  ETS 2000»
15 years 6 months ago
Parallel On-Line and In-Class Sections of "Writing for the Professions": A Practical Experiment
This paper describes experiences with on-line and in-class sections of a writing-intensive course, including a collaborative library literacy unit. It reports on a mid-semester so...
Victoria Hay, Dennis Isbell