Cauldron: A policy-based design tool

Proceedings - Seventh IEEE International Workshop on Policies for Distributed Systems and Networks, Policy 2006

Volumn 2006, Issue , 2006, Pages 113-122

  Ramshaw, Lyle ^a   Sahai, Akhil ^a   Saxe, Jim ^a   Singhal, Sharad ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MATHEMATICAL MODELS; PUBLIC POLICY;

CAULDRON; COMMON INFORMATION MODEL (CIM); OBJECT-ORIENTED MODELS;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 33845389969     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/POLICY.2006.13     Document Type: Conference Paper

References (22)

1. th IFIP/IEEE International Symposium on Integrated Network Management, Nice, France, May 15-19, 2005, pp. 265-278.
2. Alloy http://sdg.lcs.mit.edu/alloy
3. Common Information Model, http://www.dmtf.org/standards/standard_cim.php
4. Distributed Management Task Force, http://www.dmtf.org
5. Cormac Flanagan, Rajeev Joshi, Xinming Ou, and James B. Saxe, "Theorem Proving using Lazy Proof Explication", Proceedings 15th International Conference on Computer Aided Verification (CAV'03), pp. 355-367.
6. Cormac Flanagan, Rajeev Joshi, and James B. Saxe, "An explicating theorem prover for quantified formulas", HPL Technical Report HPL-2004-199.
7. SMT website, http://goedel.cs.uiowa.edu/smtlib/
8. João Marques Silva and Karem A. Sakallah, "GRASP: A search algorithm for propositionsal satisfiability", IEEE Transactions on Computers 48 #5 (1999), pp. 506-521.
9. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik, "Chaff: Engineering an efficient SAT solver", Proceedings of the 39th Design Automation Conference 2001.
10. Greg Nelson and Derek C. Oppen, "Simplification by Cooperating Decision Procedures", ACM Transactions on Programming Languages and Systems 1 #2 October 1979, pages 245-257.
11. Felfernig A, Friedrich G. E et al. UML as a domain specific knowledge for the construction of knowledge based configuration systems. In the Proceedings of SEKE'99 Eleventh International Conference on Software Engineering and Knowledge Engineering, 1999.
12. Raman R, Livny M, Solomon M. MatchMaking: Distributed Resource Management for High Throughput Computing. In the proceedings of HPDC 98.
13. IETF Policy. http://www.ietf.org/html.charters/policy-charter.html
14. http://www.dmtforg/standards/documents/CIM/CIM_Schema26/CIM_Policy26.pdf
15. Moffet J, Sloman. Policy Conflict Analysis in Distributed Systems. In the proceedings of Journal of Organizational Computing, 1993
16. Verma D, Beigi M, Jennings R. Policy based SLA Management in Enterprise Networks.Workshop on Policy, POLICY 2001.
17. Randal E. Bryant, et al., Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions, Proceedings of the 14th International Conference on Computer Aided Verification, Jul,2002, pp. 78-92.
18. David Detlefs, Greg Nelson and James B. Saxe, Simplify: A theorem-prover for program checking, Hewlett-Packard Laboratories, HPL-2003-148, Jul, 2003.
19. Cormac Flanagan et al., Extended static checking for Java, Proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2002, pp. 234-245.
20. Leonardo de Moura and Harald Ruess, Lemmas on demand for satisfiability solvers, Proceedings of the Fifth International Symposium on the Theory and Applications of Satisfiability Testing, May 2002.
21. Clark W et al., Checking satisfiability of first-order formulas by incremental translation to {SAT}, Proceedings of the 14th International Conference on Computer Aided Verification, July 2002, pp. 236-249.
22. Kim Marriott and Peter J. Stuckey, Programming with Constraints: An Introduction, MIT Press Cambridge, MA 1998.