default search action
Paul C. Attie
Person information
- affiliation: Northeastern University, Boston, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c28]Paul C. Attie
, William Cocke
Model and Program Repair via Group Actions. FoSSaCS 2023: 520-540 - 2022
- [c27]Paul C. Attie
Operational Annotations - A New Method for Sequential Program Verification. NFM 2022: 597-615 - [i10]Paul C. Attie, William Cocke:
Model Repair via Symmetry. CoRR abs/2204.11376 (2022) - 2021
- [i9]Paul C. Attie:
Operational Annotations: A new method for sequential program verification. CoRR abs/2102.06727 (2021) - 2020
- [j22]Mohamad Jaber, Yliès Falcone, Paul C. Attie
From global choreographies to verifiable efficient distributed implementations. J. Log. Algebraic Methods Program. 115: 100577 (2020)
2010 – 2019
- 2019
- [i8]Mohamad Jaber, Yliès Falcone, Paul C. Attie, Al-Abbass Khalil, Rayan Hallal:
From Global Choreographies to Provably Correct and Efficient Distributed Implementations. CoRR abs/1905.13529 (2019) - 2018
- [j21]Paul C. Attie
Model and Program Repair via SAT Solving. ACM Trans. Embed. Comput. Syst. 17(2): 32:1-32:25 (2018) - [j20]Paul C. Attie
Global and Local Deadlock Freedom in BIP. ACM Trans. Softw. Eng. Methodol. 26(3): 9:1-9:48 (2018) - 2017
- [j19]Paul C. Attie
Finite-state concurrent programs can be expressed succinctly in triple normal form. Inf. Process. Lett. 123: 8-13 (2017) - 2016
- [j18]Paul C. Attie
A general framework for architecture composability. Formal Aspects Comput. 28(2): 207-231 (2016) - [j17]Paul C. Attie
Synthesis of large dynamic concurrent programs from dynamic specifications. Formal Methods Syst. Des. 48(1-2): 94-147 (2016) - [j16]Paul C. Attie
Dynamic input/output automata: A formal and compositional model for dynamic systems. Inf. Comput. 249: 28-75 (2016) - [j15]Paul C. Attie
Finite-state concurrent programs can be expressed in pairwise normal form. Theor. Comput. Sci. 619: 1-31 (2016) - [i7]Paul C. Attie, Nancy A. Lynch:
Dynamic Input/Output Automata: a Formal and Compositional Model for Dynamic Systems. CoRR abs/1604.06030 (2016) - 2015
- [c26]Paul C. Attie
Model and program repair via SAT solving. MEMOCODE 2015: 148-157 - 2014
- [c25]Paul C. Attie
A General Framework for Architecture Composability. SEFM 2014: 128-143 - 2013
- [c24]Paul C. Attie, Saddek Bensalem, Marius Bozga, Mohamad Jaber
An Abstract Framework for Deadlock Prevention in BIP. FMOODS/FORTE 2013: 161-177 - [i6]Paul C. Attie, Fadi A. Zaraket, Mohammad Fawaz, Mohamad Noureddine:
Semantic Guidance and Feedback for the Construction of Specifications and Implementations. CoRR abs/1305.4119 (2013) - [i5]Paul C. Attie, Fadi A. Zaraket, Mohamad Noureddine, Farah El-Hariri:
Specification Construction Using Behaviours, Equivalences, and SMT Solvers. CoRR abs/1307.6901 (2013) - 2011
- [j14]Paul C. Attie:
On the refinement of liveness properties of distributed systems. Formal Methods Syst. Des. 39(1): 1-46 (2011) - [j13]Paul C. Attie, Rachid Guerraoui
The impossibility of boosting distributed service resilience. Inf. Comput. 209(6): 927-950 (2011)
2000 – 2009
- 2008
- [i4]Paul C. Attie:
Finite-state concurrent programs can be expressed pairwise. CoRR abs/0801.0677 (2008) - [i3]Paul C. Attie:
On the Refinement of Liveness Properties of Distributed Systems. CoRR abs/0801.0949 (2008) - [i2]Paul C. Attie:
Synthesis of Large Dynamic Concurrent Programs from Dynamic Specifications. CoRR abs/0801.1687 (2008) - 2007
- [i1]Paul C. Attie, Jad Saklawi:
Model and Program Repair via SAT Solvers. CoRR abs/0710.3332 (2007) - 2006
- [c23]Paul C. Attie, David H. Lorenz, Aleksandra Portnova, Hana Chockler:
Behavioral Compatibility Without State Explosion: Design and Verification of a Component-Based Elevator Control System. CBSE 2006: 33-49 - 2005
- [c22]Paul C. Attie, Rachid Guerraoui
The Impossibility of Boosting Distributed Service Resilience. ICDCS 2005: 39-48 - [c21]Paul C. Attie, Hana Chockler:
Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs. VMCAI 2005: 465-481 - [c20]Paul C. Attie, Hana Chockler:
Automatic Verification of Fault-Tolerant Register Emulations. INFINITY 2005: 49-60 - 2004
- [j12]Dina Q. Goldin, Scott A. Smolka, Paul C. Attie, Elaine L. Sonderegger:
Turing machines, transition systems, and interaction. Inf. Comput. 194(2): 101-128 (2004) - [j11]Lenore D. Zuck, Paul C. Attie, Agostino Cortesi
Preface by the section editors. Int. J. Softw. Tools Technol. Transf. 6(1): 1-3 (2004) - [j10]Paul C. Attie
Synthesis of fault-tolerant concurrent programs. ACM Trans. Program. Lang. Syst. 26(1): 125-185 (2004) - 2003
- [c19]Paul C. Attie, Adrian Lahanas, Vassilios Tsaoussidis
Beyond AIMD: Explicit Fair-share Calculation. ISCC 2003: 727-734 - [c18]Paul C. Attie:
On the Implementation Complexity of Specifications of Concurrent Programs. DISC 2003: 151-165 - [e1]Lenore D. Zuck, Paul C. Attie, Agostino Cortesi, Supratik Mukhopadhyay:
Verification, Model Checking, and Abstract Interpretation, 4th International Conference, VMCAI 2003, New York, NY, USA, January 9-11, 2002, Proceedings. Lecture Notes in Computer Science 2575, Springer 2003, ISBN 3-540-00348-7 [contents] - 2002
- [j9]Paul C. Attie:
Wait-free Byzantine consensus. Inf. Process. Lett. 83(4): 221-227 (2002) - 2001
- [j8]Paul C. Attie
Synthesis of concurrent programs for an atomic read/write model of computation. ACM Trans. Program. Lang. Syst. 23(2): 187-242 (2001) - [c17]Paul C. Attie, Nancy A. Lynch:
Dynamic Input/Output Automata: A Formal Model for Dynamic Systems. CONCUR 2001: 137-151 - [c16]Paul C. Attie, Nancy A. Lynch:
Dynamic input/output automata, a formal model for dynamic systems. PODC 2001: 314-316 - 2000
- [j7]Paul C. Attie:
Efficient formal methods for the synthesis of concurrent programs. ACM SIGSOFT Softw. Eng. Notes 25(1): 34 (2000) - [c15]Tadashi Araragi, Paul C. Attie, Idit Keidar, Kiyoshi Kogure, Victor Luchangco, Nancy A. Lynch, Ken Mano:
On Formal Modeling of Agent Computations. FAABS 2000: 48-62
1990 – 1999
- 1999
- [c14]Paul C. Attie:
Synthesis of Large Concurrent Programs via Pairwise Composition. CONCUR 1999: 130-145 - [c13]Paul C. Attie
Liveness-Preserving Simulation Relations. PODC 1999: 63-72 - 1998
- [j6]Paul C. Attie
Synthesis of Concurrent Systems with Many Similar Processes. ACM Trans. Program. Lang. Syst. 20(1): 51-115 (1998) - [c12]Anish Arora, Paul C. Attie
Synthesis of Fault-Tolerant Concurrent Programs. PODC 1998: 173-182 - 1997
- [j5]Paul C. Attie, Champak Das:
Automating the refinement of specifications for distributed systems via syntactic transformations. Int. J. Syst. Sci. 28(11): 1129-1144 (1997) - 1996
- [j4]Paul C. Attie, Munindar P. Singh
Scheduling workflows by enforcing intertask dependencies. Distributed Syst. Eng. 3(4): 222-238 (1996) - [c11]Shigang Chen, Yi Deng, Paul C. Attie, Wei Sun:
Optimal Deadlock Detection in Distributed Systems Based on Locally Constructed Wait-for Graphs. ICDCS 1996: 613-619 - [c10]Paul C. Attie
Synthesis of Concurrent Systems for an Atomic Read / Atomic Write Model of Computation (Extended Abstract). PODC 1996: 111-120 - [c9]Yi Deng, Wenliang Du, Paul C. Attie, Michael Evangelist:
A Formalism for Architectural Modeling of Distributed Real-Time Systems. SEKE 1996: 408-417 - 1995
- [c8]Munindar P. Singh, Greg Meredith, Christine Tomlinson, Paul C. Attie:
An Event Algebra for Specifying and Scheduling Workflows. DASFAA 1995: 53-60 - 1993
- [j3]Paul C. Attie, Nissim Francez, Orna Grumberg:
Fairness and Hyperfairness in Multi-Party Interactions. Distributed Comput. 6(4): 245-254 (1993) - [j2]Anish Arora, Paul C. Attie, Michael Evangelist, Mohamed G. Gouda:
Convergence of Iteration Systems. Distributed Comput. 7(1): 43-53 (1993) - [j1]Christine Tomlinson, Paul C. Attie, Philip Cannata, Greg Meredith, Amit P. Sheth, Munindar P. Singh, Darrell Woelk:
Workflow Support in Carnot. IEEE Data Eng. Bull. 16(2): 33-36 (1993) - [c7]Darrell Woelk, Paul C. Attie, Philip Cannata, Greg Meredith, Amit P. Sheth, Munindar P. Singh
Task Scheduling Using Intertask Dependencies in Carot. SIGMOD Conference 1993: 491-494 - [c6]Paul C. Attie, Munindar P. Singh, Amit P. Sheth, Marek Rusinkiewicz:
Specifying and Enforcing Intertask Dependencies. VLDB 1993: 134-145 - 1990
- [c5]Anish Arora, Paul C. Attie
Convergence of Iteration Systems (Extended Abstract). CONCUR 1990: 70-82 - [c4]Paul C. Attie
On Fairness as an Abstraction for the Design of Distributed Systems. ICDCS 1990: 150-157 - [c3]Paul C. Attie
Fairness and Hyperfairness in Multi-Party Interactions. POPL 1990: 292-305
1980 – 1989
- 1989
- [c2]Paul C. Attie
Synthesis of Concurrent Systems with Many Similar Sequential Processes. POPL 1989: 191-201 - [c1]Paul C. Attie, Glenn Bruns, Michael Evangelist, Charles Richter, Vincent Y. Shen:
Vanna: a visual environment for the design of distributed systems. TRI-Ada 1989: 546-553
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-04-25 05:38 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: