1 citations · 3 across the 5 of their papers we have counts for
5 papers
The Semantics of Rank Polymorphism
Justin Slepak, Olin Shivers, Panagiotis Manolios
Iverson's APL and its descendants (such as J, K and FISh) are examples of the family of "rank-polymorphic" programming languages. The principal control mechanism of such languages…
An Efficient Runtime Validation Framework based on the Theory of Refinement
Mitesh Jain, Panagiotis Manolios
We introduce a new methodology based on refinement for testing the functional correctness of hardware and low-level software. Our methodology overcomes several major drawbacks of t…
Skipping Refinement
Mitesh Jain, Panagiotis Manolios
We introduce skipping refinement, a new notion of correctness for reasoning about optimized reactive systems. Reasoning about reactive systems using refinement involves defining an…
ILP Modulo Theories
Panagiotis Manolios, Vasilis Papavasileiou
We present Integer Linear Programming (ILP) Modulo Theories (IMT). An IMT instance is an Integer Linear Programming instance, where some symbols have interpretations in background…
Checking Satisfiability by Dependency Sequents
Eugene Goldberg, Panagiotis Manolios
We introduce a new algorithm for checking satisfiability based on a calculus of Dependency sequents (D-sequents). Given a CNF formula F(X), a D-sequent is a record stating that und…