The following pages link to Panagiotis Manolios (Q479822):
Displaying 26 items.
- Quantifier elimination by dependency sequents (Q479823) (← links)
- Ordinal arithmetic: Algorithms and mechanization (Q851144) (← links)
- A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures (Q877828) (← links)
- Partial functions in ACL2 (Q1425160) (← links)
- On the desirability of mechanizing calculational proofs (Q1607098) (← links)
- Skipping refinement (Q1702913) (← links)
- ACL2s: “The ACL2 Sedan” (Q2867932) (← links)
- Software for Quantifier Elimination in Propositional Logic (Q2879137) (← links)
- A lattice-theoretic characterization of safety and liveness (Q2943770) (← links)
- The ACL2 Sedan Theorem Proving System (Q3000661) (← links)
- A Posteriori Soundness for Non-deterministic Abstract Interpretations (Q3600480) (← links)
- All-Termination(T) (Q3617771) (← links)
- (Q4818805) (← links)
- Model Checking Software (Q5308366) (← links)
- SAT-Solving Based on Boundary Point Elimination (Q5391525) (← links)
- An Array-Oriented Language with Static Rank Polymorphism (Q5410691) (← links)
- Efficient execution in an automated reasoning environment (Q5437032) (← links)
- Formal Methods in Computer-Aided Design (Q5492968) (← links)
- Formal Methods in Computer-Aided Design (Q5492993) (← links)
- Correct Hardware Design and Verification Methods (Q5493246) (← links)
- Interactive Termination Proofs Using Termination Cores (Q5747661) (← links)
- Termination Analysis with Calling Context Graphs (Q5756741) (← links)
- Correct Hardware Design and Verification Methods (Q5897075) (← links)
- Formal Methods for Hardware Verification (Q5899157) (← links)
- Automated Deduction – CADE-19 (Q5900722) (← links)
- Integrating testing and interactive theorem proving (Q6586529) (← links)
