Sciweavers

429 search results - page 68 / 86
» Symbolic Computation Software Composability
Sort
View
AOSD
2003
ACM
14 years 24 days ago
Quantifying aspects in middleware platforms
Middleware technologies such as Web Services, CORBA and DCOM have been very successful in solving distributed computing problems for a large family of application domains. As midd...
Charles Zhang, Hans-Arno Jacobsen
DAC
2003
ACM
14 years 8 months ago
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
Sanjit A. Seshia, Shuvendu K. Lahiri, Randal E. Br...
FOSSACS
2009
Springer
14 years 2 months ago
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
Christopher Broadbent, C.-H. Luke Ong
LICS
2003
IEEE
14 years 25 days ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
IS
1998
13 years 7 months ago
Information Modeling in the Time of the Revolution
Information modeling is concerned with the construction of computer-based symbol structures which capture the meaning of information and organize it in ways that make it understan...
John Mylopoulos