81 search results - page 9 / 17 » On the verification of polynomial system solvers |
FMICS
2010
Springer
15 years 22 days ago
2010
Springer
Abstract. TTEthernet is a communication infrastructure for mixedcriticality systems that integrates dataflow from applications with different criticality levels on a single network...
201
Voted
PLDI
2009
ACM
16 years 8 days ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
84
Voted
IJCAI
2003
15 years 1 months ago
2003
Efficient implementations of DPLL with the addition of clause learning are the fastest complete satisfiability solvers and can handle many significant real-world problems, such as...
93
Voted
CADE
2006
Springer
15 years 12 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
84
Voted
POPL
2010
ACM
15 years 9 months ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...