NDLI: Routing under constraints

Please wait, while we are loading the content...

Formal verification for computer security: lessons learned and future directions

Understanding evolution through algorithms

Network verification: when Clarke meets Cerf

Machine learning and systems for the next frontier in formal verification

Verifying hyperproperties of hardware systems

A paradigm shift in verification methodology

Program synthesis for networks

The FMCAD 2016 graduate student forum

Soundness of the quasi-synchronous abstraction

Synthesizing adaptive test strategies from temporal logic specifications

Reducing interpolant circuit size by ad-hoc logic synthesis and SAT-based weakening

Extracting behaviour from an executable instruction set model

Categorical semantics of digital circuits

Equivalence checking by logic relaxation

Minimal unsatisfiable core extraction for SMT

Efficient uninterpreted function abstraction and refinement for word-level model checking

Optimizing horn solvers for network repair

On ∃ ∀ ∃! solving: a case study on automated synthesis of magic card tricks

Property-directed k-induction

Lazy proofs for DPLL(T)-based SMT solvers

Verifiable hierarchical protocols with network invariants on parametric systems

Modular specification and verification of a cache-coherent interface

Proof certificates for SMT-based model checkers for infinite-state systems

Routing under constraints

A consistency checker for memory subsystem traces

Hybrid partial order reduction with under-approximate dynamic points-to and determinacy information

Formal verification of division and square root implementations, an Oracle report

Integrating proxy theories and numeric model lifting for floating-point arithmetic

Trustworthy specifications of ARM® v8-A and v8-M system level architecture

Equivalence checking using Gröbner bases

Accurate ICP-based floating-point reasoning

Swapper: a framework for automatic generation of formula simplifiers based on conditional rewrite rules

Lazy sequentialization for TSO and PSO via shared memory abstractions

Combining requirement mining, software model checking and simulation-based verification for industrial automotive systems

Routing under constraints

Content Provider	ACM Digital Library
Author	Nadel, Alexander
Abstract	Routing is an essential stage in physical design, where already placed components are connected by wires. Routing must satisfy various manufacturing requirements, referred to as design rules. We formalize the problem of design-rule-aware routing and introduce a solver, called DRouter, for the resulting problem. Plain routing is often modeled as follows: given an undirected weighted graph and a set of m disjoint nets (each net being a set of vertices), a routing is a (minimal) forest of m disjoint trees, where each tree spans a net. DRouter's input comprises a plain routing instance and a bit-vector formula, whose variables include the edges of the graph as Boolean variables (along with other variables). DRouter looks for a satisfying assignment to F, such that the satisfied edges comprise a routing. DRouter implements an A*-based router inside a SAT solver. It overrides the solver's decision and restart strategies and enhances its learning with routing-aware algorithms. We demonstrate that, on a set of crafted routing instances, DRouter has substantially better capacity than either plain reduction to bit-vector reasoning or Monosat, a solver that is able to reason about SAT and graph predicates. We show that DRouter can route large clips from Intel designs while obeying up to millions of applications of the design rules-a task two industrial routers failed to accomplish.
Starting Page	125
Ending Page	132
Page Count	8
File Format	PDF
ISBN	9780983567868
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-10-03
Publisher Place	Austin
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Maze Routing with Buffer Insertion under Transition Time Constraints

Group aware cooperative routing for opportunistic networks under resource constraints

Impact of source counter on DTN routing control under resource constraints

RPL routing for multigateway AMI networks under interference constraints

An efficient technology mapping algorithm targeting routing congestion under delay constraints

Multi-robot routing under connectivity constraints

Redundant via insertion under timing constraints

Integrated high-level synthesis and power-net routing for digital design under switching noise constraints

Performance of Delay Tolerant Mobile Networks under propagation and buffer capacity constraints

Routing under constraints

Similar Documents

Maze Routing with Buffer Insertion under Transition Time Constraints

Group aware cooperative routing for opportunistic networks under resource constraints

Impact of source counter on DTN routing control under resource constraints

RPL routing for multigateway AMI networks under interference constraints

An efficient technology mapping algorithm targeting routing congestion under delay constraints

Multi-robot routing under connectivity constraints

Redundant via insertion under timing constraints

Integrated high-level synthesis and power-net routing for digital design under switching noise constraints

Performance of Delay Tolerant Mobile Networks under propagation and buffer capacity constraints

Routing under constraints