Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Nina Amla"'
Publikováno v:
Communications of the ACM. 66:36-37
Publikováno v:
ACI
In the last decade, there has been a growing public interest in the welfare of farm animals. These societal and economic factors have led to the development of smart farming applications, but many important features of animal welfare are either missi
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Animals play a profoundly important and intricate role in our lives today. Dogs have been human companions for thousands of years, but now they work to assist the disabled, and in combat and search and rescue situations. Farm animals are a critical p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5acf9b3df4db6bec112073159464c7c7
https://hdl.handle.net/2117/104909
https://hdl.handle.net/2117/104909
Autor:
Amla, Nina1 namla@nsf.gov, Da Silva, Dilma2 ddasilva@nsf.gov, Littman, Michael3 mlittman@nsf.gov, Parashar, Manish4 mparasha@nsf.gov
Publikováno v:
Communications of the ACM. May2023, Vol. 66 Issue 5, p36-37. 2p. 1 Color Photograph.
Autor:
Nina Amla, Kenneth L. McMillan
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783540712084
TACAS
TACAS
Unbounded model checking methods based on Boolean satisfiability (SAT) solvers are proving to be a viable alternative to BDD-based model checking. These methods include, for example, interpolation based and sequential ATPG-based approaches. In this p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4148fa22c7305cfe8c2de1c3bb5c0332
https://doi.org/10.1007/978-3-540-71209-1_31
https://doi.org/10.1007/978-3-540-71209-1_31
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540291053
CHARME
CHARME
Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision Diagrams (BDDs) are used to efficiently encode the transition relation of the finit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ec9c41ba7a4cb7c821414cc35d18b74
https://doi.org/10.1007/11560548_20
https://doi.org/10.1007/11560548_20
Autor:
Nina Amla, Kenneth L. McMillan
Publikováno v:
Formal Methods in Computer-Aided Design ISBN: 9783540237389
FMCAD
FMCAD
Counterexample- and proof-based refinement are complementary approaches to iterative abstraction. In the former case, a single abstract counterexample is eliminated by each refinement step, while in the latter case, all counterexamples of a given len
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee209f13ebdd17952b69e71db2c05658
https://doi.org/10.1007/978-3-540-30494-4_19
https://doi.org/10.1007/978-3-540-30494-4_19
Autor:
Paul Ammann, Nina Amla
Publikováno v:
COMPASS `92 Proceedings of the Seventh Annual Conference on Computer Assurance.
The application of specification-based test methods to informal functional specifications requires considerable analysis on the part of the test engineer. The authors hypothesize that a large portion of this analysis is already present in formal func
Autor:
Nina Amla, Kenneth L. McMillan
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783540008989
TACAS
TACAS
A method of automatic abstraction is presented that uses proofs of unsatisfiability derived from SAT-based bounded model checking as a guide to choosing an abstraction for unbounded model checking. Unlike earlier methods, this approach is not based o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::744d0b7ed5c741039624d63829f36d9d
https://doi.org/10.1007/3-540-36577-x_2
https://doi.org/10.1007/3-540-36577-x_2
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783540008989
TACAS
TACAS
Bounded model checking (BMC) is a procedure that searches for counterexamples to a given property through bounded executions of a non-terminating system. This paper compares the performance of SAT-based, BDD-based and explicit state based BMC on benc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::827b4c8687b598a4b7f9358b7f7138ab
https://doi.org/10.1007/3-540-36577-x_4
https://doi.org/10.1007/3-540-36577-x_4