Sciweavers

21 search results - page 2 / 5
» Newtonian program analysis via tensor product
Sort
View
ASPLOS
2011
ACM
12 years 8 months ago
Improving software diagnosability via log enhancement
Diagnosing software failures in the field is notoriously difficult, in part due to the fundamental complexity of trouble-shooting any complex software system, but further exacer...
Ding Yuan, Jing Zheng, Soyeon Park, Yuanyuan Zhou,...
FMCO
2005
Springer
156views Formal Methods» more  FMCO 2005»
13 years 10 months ago
On a Probabilistic Chemical Abstract Machine and the Expressiveness of Linda Languages
babilistic Chemical Abstract Machine and the Expressiveness of Linda Languages Alessandra Di Pierro1 , Chris Hankin2 , and Herbert Wiklicky2 1 Dipartimento di Informatica, Universi...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
POPL
1994
ACM
13 years 9 months ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
IEEEIAS
2009
IEEE
13 years 11 months ago
Fuzzy Intrusion Detection System via Data Mining Technique with Sequences of System Calls
: There are two main approaches for implementing IDS; Host based and Network based. While the former is implemented in form of software deployed on a host, the latter, usually is b...
Mohammad Akbarpour Sekeh, Mohd. Aizani Bin Maarof
SAC
2006
ACM
13 years 4 months ago
Challenges in the compilation of a domain specific language for dynamic programming
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...
Robert Giegerich, Peter Steffen