Incer et al., 2024 - Google Patents
Pacti: Assume-Guarantee Contracts for Efficient Compositional Analysis and DesignIncer et al., 2024
View PDF- Document ID
- 3343504632799327041
- Author
- Incer I
- Badithela A
- Graebener J
- Mallozzi P
- Pandey A
- Rouquette N
- Yu S
- Benveniste A
- Caillaud B
- Murray R
- Sangiovanni-Vincentelli A
- Seshia S
- Publication year
- Publication venue
- ACM Transactions on Cyber-Physical Systems
External Links
Snippet
Contract-based design is a method to facilitate modular design of systems. While there has been substantial progress on the theory of contracts, there has been less progress on practical algorithms for the algebraic operations in the theory. In this paper, we present 1) …
- 238000013461 design 0 title abstract description 67
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
- G06F17/504—Formal methods
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5045—Circuit design
- G06F17/505—Logic synthesis, e.g. technology mapping, optimisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
- G06N5/02—Knowledge representation
- G06N5/022—Knowledge engineering, knowledge acquisition
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2217/00—Indexing scheme relating to computer aided design [CAD]
- G06F2217/78—Power analysis and optimization
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformations of program code
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
- G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B13/00—Adaptive control systems, i.e. systems automatically adjusting themselves to have a performance which is optimum according to some preassigned criterion
- G05B13/02—Adaptive control systems, i.e. systems automatically adjusting themselves to have a performance which is optimum according to some preassigned criterion electric
- G05B13/04—Adaptive control systems, i.e. systems automatically adjusting themselves to have a performance which is optimum according to some preassigned criterion electric involving the use of models or simulators
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Shoukry et al. | SMC: Satisfiability modulo convex optimization | |
Bryant et al. | Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic | |
Burch et al. | Symbolic model checking for sequential circuit verification | |
Grossmann et al. | Part II. Future perspective on optimization | |
Dutertre et al. | The yices smt solver | |
Burch | Techniques for verifying superscalar microprocessors | |
Batt et al. | Temporal logic analysis of gene networks under parameter uncertainty | |
Kim et al. | Constructing control system abstractions from modular components | |
CA2943044C (en) | Solving np-complete problems without hyper-polynomial cost | |
Fourman | Propositional planning | |
De Backer et al. | A CLP language handling disjunctions of linear constraints | |
Zhang et al. | An executable semantics of clock constraint specification language and its applications | |
Benveniste et al. | Structural analysis of multi-mode DAE systems | |
Incer et al. | Pacti: Assume-Guarantee Contracts for Efficient Compositional Analysis and Design | |
Roig et al. | Hierarchical gate-level verification of speed-independent circuits | |
Zheng | Specification and compilation of timed systems | |
Burch et al. | Symbolic model checking for sequential circuit verification | |
Jeřábek | Root finding with threshold circuits | |
Simić et al. | Bit-precise verification of discontinuity errors under fixed-point arithmetic | |
Amram et al. | Adapting behaviors via reactive synthesis | |
Vu | Rigorous solution techniques for numerical constraint satisfaction problems | |
Shiple et al. | Automatic reduction in CTL compositional model checking | |
Kuśmierek | The inhabitation problem for rank two intersection types | |
Becker et al. | Bounded Model Checking and Inductive Verification of Hybrid Discrete-continuous Systems. | |
Koutsoukos et al. | Computational issues in intelligent control: Discrete-event and hybrid systems |