default search action
Panagiotis Manolios
Pete Manolios – Peter Manolios
Person information
- affiliation: Northeastern University, Khoury College of Computer Sciences, Boston, MA, USA
- affiliation: Georgia Institute of Technology, College of Computing, Atlanta, GA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c72]Ankit Kumar, Max von Hippel, Panagiotis Manolios, Cristina Nita-Rotaru:
Formal Model-Driven Analysis of Resilience of GossipSub to Attacks from Misbehaving Peers. SP 2024: 2142-2160 - [i16]Zixuan Chen, Panagiotis Manolios, Mirek Riedewald:
Finding Linear Explanations for a Given Ranking. CoRR abs/2406.11797 (2024) - 2023
- [j13]Zixuan Chen, Panagiotis Manolios, Mirek Riedewald:
Why Not Yet: Fixing a Top-k Ranking that Is Not Fair to Individuals. Proc. VLDB Endow. 16(9): 2377-2390 (2023) - [c71]Max von Hippel, Panagiotis Manolios, Kenneth L. McMillan, Cristina Nita-Rotaru, Lenore D. Zuck:
A Case Study in Analytic Protocol Analysis in ACL2. ACL2 2023: 50-66 - [c70]Ruben Gamboa, Panagiotis Manolios, Eric Whitman Smith, Kyle Thompson:
Using Counterexample Generation and Theory Exploration to Suggest Missing Hypotheses. ACL2 2023: 82-93 - [c69]Ankit Kumar, Max von Hippel, Panagiotis Manolios, Cristina Nita-Rotaru:
Verification of GossipSub in ACL2s. ACL2 2023: 113-132 - [c68]Andrew T. Walter, Ankit Kumar, Panagiotis Manolios:
Proving Calculational Proofs Correct. ACL2 2023: 133-150 - [i15]Andrew T. Walter, Ankit Kumar, Panagiotis Manolios:
Calculational Proofs in ACL2s. CoRR abs/2307.12224 (2023) - 2022
- [c67]Andrew T. Walter
, David A. Greve, Panagiotis Manolios
Enumerative Data Types with Constraints. FMCAD 2022: 189-198 - [c66]Ankit Kumar
Automated Grading of Automata with ACL2s. ThEdu@FLoC 2022: 77-91 - [c65]Andrew T. Walter, Panagiotis Manolios
ACL2s Systems Programming. ACL2 2022: 134-150 - [i14]Ankit Kumar, Max von Hippel, Pete Manolios
Formal Model-Driven Analysis of Resilience of GossipSub to Attacks from Misbehaving Peers. CoRR abs/2212.05197 (2022) - 2021
- [c64]Ankit Kumar
Mathematical Programming Modulo Strings. FMCAD 2021: 261-270 - [i13]Andrew T. Walter, Seth Cooper, Panagiotis Manolios:
A Reasoning Engine for the Gamification of Loop-Invariant Discovery. CoRR abs/2109.01121 (2021) - 2020
- [c63]Benjamin Quiring
GACAL: Conjecture-Based Verification - (Competition Contribution). TACAS (2) 2020: 388-392
2010 – 2019
- 2019
- [j12]Abha Moitra
Automating requirements analysis and test case generation. Requir. Eng. 24(3): 341-364 (2019) - [c62]Mitesh Jain, Panagiotis Manolios
Local and Compositional Reasoning for Optimized Reactive Systems. CAV (1) 2019: 553-571 - [c61]Andrew T. Walter
Gamification of Loop-Invariant Discovery from Code. HCOMP 2019: 188-196 - [c60]Justin Slepak, Olin Shivers, Panagiotis Manolios
Records with rank polymorphism. ARRAY@PLDI 2019: 80-92 - [i12]Justin Slepak, Olin Shivers, Panagiotis Manolios:
The Semantics of Rank Polymorphism. CoRR abs/1907.00509 (2019) - [i11]Olin Shivers, Justin Slepak, Panagiotis Manolios:
Introduction to Rank-polymorphic Programming in Remora (Draft). CoRR abs/1912.13451 (2019) - 2018
- [j11]Maria Pittou, Panagiotis Manolios
Checking multi-view consistency of discrete systems with respect to periodic sampling abstractions. Sci. Comput. Program. 167: 1-24 (2018) - [c59]Justin Slepak, Panagiotis Manolios
Rank polymorphism viewed as a constraint problem. ARRAY@PLDI 2018: 34-41 - [c58]Abha Moitra, Kit Siu, Andrew W. Crapo, Harsh Raju Chamarthi, Michael Durling, Meng Li, Han Yu, Panagiotis Manolios
Towards Development of Complete and Conflict-Free Requirements. RE 2018: 286-296 - 2017
- [i10]Mitesh Jain, Panagiotis Manolios:
An Efficient Runtime Validation Framework based on the Theory of Refinement. CoRR abs/1703.05317 (2017) - 2015
- [c57]Panagiotis Manolios
The Inez Mathematical Programming Modulo Theories Framework. CAV (2) 2015: 53-69 - [c56]Mitesh Jain, Panagiotis Manolios
Skipping Refinement. CAV (1) 2015: 103-119 - [c55]Greg Eakman, Howard Reubenstein, Tom Hawkins, Mitesh Jain, Panagiotis Manolios
Practical Formal Verification of Domain-Specific Language Applications. NFM 2015: 443-449 - [c54]Mitesh Jain, Panagiotis Manolios
Proving Skipping Refinement with ACL2s. ACL2 2015: 111-127 - [i9]Mitesh Jain, Panagiotis Manolios:
Skipping Refinement. CoRR abs/1502.02942 (2015) - 2014
- [j10]Eugene Goldberg, Panagiotis Manolios
Quantifier elimination by dependency sequents. Formal Methods Syst. Des. 45(2): 111-143 (2014) - [c53]Justin Slepak, Olin Shivers, Panagiotis Manolios
An Array-Oriented Language with Static Rank Polymorphism. ESOP 2014: 27-46 - [c52]Panagiotis Manolios
ILP Modulo Data. FMCAD 2014: 171-178 - [c51]Eugene Goldberg, Panagiotis Manolios
Partial Quantifier Elimination. Haifa Verification Conference 2014: 148-164 - [c50]Eugene Goldberg, Panagiotis Manolios
Software for Quantifier Elimination in Propositional Logic. ICMS 2014: 291-294 - [c49]Harsh Raju Chamarthi, Peter C. Dillinger, Panagiotis Manolios
Data Definitions in the ACL2 Sedan. ACL2 2014: 27-48 - [i8]Panagiotis Manolios, Vasilis Papavasileiou, Mirek Riedewald:
ILP Modulo Data. CoRR abs/1404.5665 (2014) - [i7]Eugene Goldberg, Panagiotis Manolios:
Partial Quantifier Elimination. CoRR abs/1407.4835 (2014) - [i6]Eugene Goldberg, Panagiotis Manolios:
Bug Hunting By Computing Range Reduction. CoRR abs/1408.7039 (2014) - 2013
- [c48]Panagiotis Manolios
ILP Modulo Theories. CAV 2013: 662-677 - [c47]Eugene Goldberg, Panagiotis Manolios:
Quantifier elimination via clause redundancy. FMCAD 2013: 85-92 - [c46]Panagiotis Manolios:
Counterexample Generation Meets Interactive Theorem Proving: Current Results and Future Opportunities. ITP 2013: 18 - [i5]Eugene Goldberg, Mitesh Jain, Panagiotis Manolios:
Verification of Sequential Circuits by Tests-As-Proofs Paradigm. CoRR abs/1308.0583 (2013) - 2012
- [c45]Eugene Goldberg, Panagiotis Manolios:
Quantifier elimination by Dependency Sequents. FMCAD 2012: 34-43 - [i4]Eugene Goldberg, Panagiotis Manolios:
Quantifier Elimination by Dependency Sequents. CoRR abs/1201.5653 (2012) - [i3]Eugene Goldberg, Panagiotis Manolios:
Removal of Quantifiers by Elimination of Boundary Points. CoRR abs/1204.1746 (2012) - [i2]Eugene Goldberg, Panagiotis Manolios:
Checking Satisfiability by Dependency Sequents. CoRR abs/1207.5014 (2012) - [i1]Panagiotis Manolios, Vasilis Papavasileiou:
ILP Modulo Theories. CoRR abs/1210.3761 (2012) - 2011
- [c44]Christine Hang, Panagiotis Manolios
Synthesizing Cyber-Physical Architectural Models with Real-Time Constraints. CAV 2011: 441-456 - [c43]Panagiotis Manolios, Vasilis Papavasileiou:
Pseudo-Boolean Solving by incremental translation to SAT. FMCAD 2011: 41-45 - [c42]Harsh Raju Chamarthi, Panagiotis Manolios
Automated specification analysis using an interactive theorem prover. FMCAD 2011: 46-53 - [c41]Harsh Raju Chamarthi, Peter C. Dillinger, Panagiotis Manolios
The ACL2 Sedan Theorem Proving System. TACAS 2011: 291-295 - [c40]Harsh Raju Chamarthi, Peter C. Dillinger, Matt Kaufmann, Panagiotis Manolios
Integrating Testing and Interactive Theorem Proving. ACL2 2011: 4-19 - 2010
- [c39]Eugene Goldberg, Panagiotis Manolios
SAT-Solving Based on Boundary Point Elimination. Haifa Verification Conference 2010: 93-111 - [c38]Panagiotis Manolios
Interactive Termination Proofs Using Termination Cores. ITP 2010: 355-370 - [c37]Eugene Goldberg, Panagiotis Manolios
Generating High-Quality Tests for Boolean Circuits by Treating Tests as Proof Encoding. TAP@TOOLS 2010: 101-116 - [p1]Panagiotis Manolios
Verifying Pipelines with BAT. Design and Verification of Microprocessor Systems for High-Assurance Applications 2010: 145-174
2000 – 2009
- 2009
- [c36]Benjamin Chambers, Panagiotis Manolios
Faster SAT solving with better CNF generation. DATE 2009: 1590-1595 - [c35]Peter C. Dillinger, Panagiotis Manolios
Fast, All-Purpose State Storage. SPIN 2009: 12-31 - [c34]Panagiotis Manolios
All-Termination(T). TACAS 2009: 398-412 - [c33]Matthew Might, Panagiotis Manolios
A PosterioriSoundness for Non-deterministic Abstract Interpretations. VMCAI 2009: 260-274 - 2008
- [j9]David A. Greve, Matt Kaufmann, Panagiotis Manolios
Efficient execution in an automated reasoning environment. J. Funct. Program. 18(1): 15-46 (2008) - [j8]Panagiotis Manolios
Automatic verification of safety and liveness for pipelined machines using WEB refinement. ACM Trans. Design Autom. Electr. Syst. 13(3): 45:1-45:19 (2008) - [j7]William G. J. Halfond, Alessandro Orso, Pete Manolios
WASP: Protecting Web Applications Using Positive Tainting and Syntax-Aware Evaluation. IEEE Trans. Software Eng. 34(1): 65-81 (2008) - [j6]Panagiotis Manolios
A Refinement-Based Compositional Reasoning Framework for Pipelined Machine Verification. IEEE Trans. Very Large Scale Integr. Syst. 16(4): 353-364 (2008) - 2007
- [c32]Panagiotis Manolios
BAT: The Bit-Level Analysis Tool. CAV 2007: 303-306 - [c31]Peter C. Dillinger, Panagiotis Manolios
ACL2s: "The ACL2 Sedan". ICSE Companion 2007: 59-60 - [c30]Panagiotis Manolios
Automating component-based system assembly. ISSTA 2007: 61-72 - [c29]Panagiotis Manolios
Efficient Circuit to CNF Conversion. SAT 2007: 4-9 - [c28]Panagiotis Manolios
Checking Pedigree Consistency with PCS. TACAS 2007: 339-342 - 2006
- [j5]Panagiotis Manolios
A Framework for Verifying Bit-Level Pipelined Machines Based on Automated Deduction and Decision Procedures. J. Autom. Reason. 37(1-2): 93-116 (2006) - [c27]Panagiotis Manolios
Termination Analysis with Calling Context Graphs. CAV 2006: 401-414 - [c26]Roma Kane, Panagiotis Manolios
Monolithic verification of deep pipelines with collapsed flushing. DATE 2006: 1234-1239 - [c25]Panagiotis Manolios
Automatic memory reductions for RTL model verification. ICCAD 2006: 786-793 - [c24]Panagiotis Manolios
Integrating static analysis and general-purpose theorem proving for termination analysis. ICSE 2006: 873-876 - [c23]Panagiotis Manolios
Implementing Survey Propagation on Graphics Processing Units. SAT 2006: 311-324 - [c22]Panagiotis Manolios
Refinement and Theorem Proving. SFM 2006: 176-210 - [c21]William G. J. Halfond, Alessandro Orso, Panagiotis Manolios
Using positive tainting and syntax-aware evaluation to counter SQL injection attacks. SIGSOFT FSE 2006: 175-185 - [c20]Peter C. Dillinger, Panagiotis Manolios
ACL2s: "The ACL2 Sedan". UITP@FLoC 2006: 3-18 - [e1]Panagiotis Manolios, Matthew Wilding:
Proceedings of the Sixth International Workshop on the ACL2 Theorem Prover and its Applications, ACL2 2006, Seattle, Washington, USA, August 15-16, 2006. ACM 2006, ISBN 0-9788493-0-2 [contents] - 2005
- [j4]Panagiotis Manolios
Ordinal Arithmetic: Algorithms and Mechanization. J. Autom. Reason. 34(4): 387-423 (2005) - [c19]Panagiotis Manolios
A Parameterized Benchmark Suite of Hard Pipelined-Machine-Verification Problems. CHARME 2005: 363-366 - [c18]Panagiotis Manolios
Refinement Maps for Efficient Verification of Processor Models. DATE 2005: 1304-1309 - [c17]Panagiotis Manolios
Verification of executable pipelined machines with bit-level interfaces. ICCAD 2005: 855-862 - [c16]Panagiotis Manolios
A complete compositional reasoning framework for the efficient verification of pipelined machines. ICCAD 2005: 863-870 - [c15]Panagiotis Manolios
A computationally ef~cient method based on commitment re~nement maps for verifying pipelined machines. MEMOCODE 2005: 188-197 - [c14]Peter C. Dillinger, Panagiotis Manolios
Enhanced Probabilistic Verification with 3Spin and 3Murphi. SPIN 2005: 272-276 - [c13]Panagiotis Manolios
The Challenge of Hardware-Software Co-verification. VSTTE 2005: 438-447 - 2004
- [c12]Panagiotis Manolios
Automatic Verification of Safety and Liveness for XScale-Like Processor Models Using WEB Refinements. DATE 2004: 168-175 - [c11]Panagiotis Manolios
Integrating Reasoning About Ordinal Arithmetic into ACL2. FMCAD 2004: 82-97 - [c10]Peter C. Dillinger, Panagiotis Manolios
Bloom Filters in Probabilistic Verification. FMCAD 2004: 367-381 - [c9]Peter C. Dillinger, Panagiotis Manolios
Fast and Accurate Bitstate Verification for SPIN. SPIN 2004: 57-75 - 2003
- [j3]Panagiotis Manolios
Partial Functions in ACL2. J. Autom. Reason. 31(2): 107-127 (2003) - [c8]Panagiotis Manolios
Algorithms for Ordinal Arithmetic. CADE 2003: 243-257 - [c7]Panagiotis Manolios
A Compositional Theory of Refinement for Branching Time. CHARME 2003: 304-318 - [c6]Panagiotis Manolios
A lattice-theoretic characterization of safety and liveness. PODC 2003: 325-333 - [c5]Panagiotis Manolios
Brief announcement: branching time refinement. PODC 2003: 334 - 2001
- [j2]Panagiotis Manolios
On the desirability of mechanizing calculational proofs. Inf. Process. Lett. 77(2-4): 173-179 (2001) - [c4]Panagiotis Manolios
Safety and Liveness in Branching Time. LICS 2001: 366-374 - 2000
- [c3]Panagiotis Manolios:
Correctness of Pipelined Machines. FMCAD 2000: 161-178
1990 – 1999
- 1999
- [c2]Panagiotis Manolios
Linking Theorem Proving and Model-Checking with Well-Founded Bisimulation. CAV 1999: 369-379 - [c1]Yuan Yu, Panagiotis Manolios
Model Checking TLA+ Specifications. CHARME 1999: 54-66 - 1994
- [j1]Peter Manolios
First-Order Recurrent Neural Networks and Deterministic Finite State Automata. Neural Comput. 6(6): 1155-1173 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 23:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: