Browsing Computer Science by Author "Lapets, Andrei"

OpenBU

Browsing Computer Science by Author "Lapets, Andrei"

Sort by: Order: Results:

  • Lapets, Andrei (CS Department, Boston University, 2010-03-15)
    A problem is in the class NP when it is possible to compute in polynomial time that a given solution corresponds to a given problem instance. Those problems for which it is possible to compute in polynomial time a solution ...
  • Donnelly, Kevin; Kfoury, Assaf; Lapets, Andrei (CS Department, Boston University, 2010-03-15)
    Interdomain routing on the Internet is performed using route preference policies specified independently and arbitrarily by each autonomous system (AS) in the network. These policies are used in the border gateway protocol ...
  • Lapets, Andrei; House, DAvid (Boston University Computer Science Department, 2009-11-06)
    In work that involves mathematical rigor, there are numerous benefits to adopting a representation of models and arguments that can be supplied to a formal reasoning or verification system: reusability, automatic evaluation ...
  • Ishakian, Vatche; Lapets, Andrei; Bestavros, Azer; Kfoury, Assaf (CS Department, Boston University, 2010-08-24)
    Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for unencumbered use by the application. ...
  • Lapets, Andrei (Boston University Computer Science Department, 2009-04-30)
    In research areas involving mathematical rigor, there are numerous benefits to adopting a formal representation of models and arguments: reusability, automatic evaluation of examples, and verification of consistency and ...
  • Lapets, Andrei (Boston University Computer Science Department, 2009-11-06)
    In college courses dealing with material that requires mathematical rigor, the adoption of a machine-readable representation for formal arguments can be advantageous. Students can focus on a specific collection of constructs ...
  • Lapets, Andrei; Kfoury, Assaf (CS Department, Boston University, 2010-03-14)
    Interdomain routing on the internet is performed using route preference policies specified independently and arbitrarily by each autonomous system (AS) in the network. These policies are used in the border gateway protocol ...
  • Lapets, Andrei; Lalwani, Prakash; Kfoury, Assaf (CS Department, Boston University, 2010-05-14)
    The usability of verification systems is becoming increasingly important, and the effective integration of ontologies of formal facts (definitions, propositions, and syntactic idioms) into machine verification systems will ...
  • Lapets, Andrei; Kfoury, Assaf; Bestavros, Azer (CS Department, Boston University, 2010-01-19)
    NetSketch is a tool for the specification of constrained-flow networks (CFNs) and the certification of desirable safety properties imposed thereon, conceived to assist system integrators in modeling and design. It provides ...
  • Bestavros, Azer; Kfoury, Assaf; Lapets, Andrei; Ocean, Michael (Boston University Computer Science Department, 2009-10-30)
    NetSketch is a tool for the specification of constrained-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system integrators in two types of activities: ...
  • Bestavros, Azer; Kfoury, Assaf; Lapets, Andrei; Ocean, Michael (Boston University Computer Science Department, 2009-10-01)
    NetSketch is a tool that enables the specification of network-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system integrators in two types of ...
  • Lapets, Andrei; Levin, Alex; Parkes, David (Boston University Computer Science Department, 2008-10-09)
    We first introduce a very simple typed language for expressing allocation algorithms that allows automatic verification that an algorithm is monotonic and therefore truthful. The analysis of truthfulness is accomplished ...
  • Lapets, Andrei; Kfoury, Assaf (CS Department, Boston University, 2010-05-14)
    User-friendly interfaces can play an important role in bringing the benefits of a machine-readable representation of formal arguments to a wider audience. The "aartifact" system is an easy-to-use lightweight verifier for ...
  • Lapets, Andrei (CS Department, Boston University, 2010-05-14)
    Machine verification of formal arguments can only increase our confidence in the correctness of those arguments, but the costs of employing machine verification still outweigh the benefits for some common kinds of formal ...
  • Lapets, Andrei; Kfoury, Assaf (Boston University Computer Science Department, 2009-10-01)
    In research areas involving mathematical rigor, there are numerous benefits to adopting a formal representation of models and arguments: reusability, automatic evaluation of examples, and verification of consistency and ...

Search OpenBU


Advanced Search

Browse

Deposit Materials