{"title":"Keynote talk III: A framework for modeling architectures and their properties","authors":"J. Sifakis","doi":"10.1109/MEMCOD.2014.6961866","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961866","url":null,"abstract":"Architectures are common means for organizing coordination between components in order to build complex systems and to make them manageable. Despite the progress of the state of the art over the past decades, there are still a lot of foundational issues that remain unsolved. In this talk we present a general framework for modeling architectures and their properties.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115514076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimized distribution of synchronous programs via a polychronous model","authors":"Ke Sun, L. Besnard, T. Gautier","doi":"10.1109/MEMCOD.2014.6961842","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961842","url":null,"abstract":"This paper presents a distribution methodology for synchronous programs, applied in particular on programs written in the Quartz language. The given program is first transformed into an intermediate model of guarded actions. After user-specified partitioning, the generated sub-models are transformed into Signal processes. Using the multi-clock calculation model of the Signal language, an optimized data-flow network can be automatically constructed. The optimization includes reducing the communication quantity and the computation load, with no change to the interface behaviors.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128439334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Assertion-based flow monitoring of SystemC models","authors":"Sonali Dutta, Moshe Y. Vardi","doi":"10.1109/MEMCOD.2014.6961853","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961853","url":null,"abstract":"SystemC is the de facto standard system-modeling language for hardware-software systems. A concurrent and reactive hardware-software system performs different “jobs” during its execution. Each such job begins with a set of input data, flows through different processes in the system, and finally produces a set of output data. We call such a job a flow, since it flows from one process to another. Flows are dynamic and concurrent; a flow can begin anytime during the simulation and the system can process multiple flows at the same time. We provide a library for explicitly implementing flows in a SystemC model or annotating flows in an existing SystemC model with minimal modification. We also provide an automated monitoring framework for monitoring properties of flows. Such properties capture the reactive nature of a system naturally and are intuitive to write. Our experimental results show that the framework adds minimal simulation runtime overhead.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"9 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125079229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Alexandru Tanase, Michael Witterauf, J. Teich, Frank Hannig
{"title":"Symbolic inner loop parallelisation for massively parallel processor arrays","authors":"Alexandru Tanase, Michael Witterauf, J. Teich, Frank Hannig","doi":"10.1109/MEMCOD.2014.6961865","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961865","url":null,"abstract":"This paper presents a first solution to the unsolved problem of symbolically scheduling a given loop nest with uniform data dependences using inner loop parallelization, in particular, the locally parallel, globally sequential (LPGS) mapping technique. This technique is needed in the case of loop program specifications for which the iterations shall be scheduled on a processor array of unknown size at compile time while keeping the local memory consumption independent of the problem size of the mapped loop nest. We show that it is possible to derive such parameterized LPGS schedules statically by proposing a mixed compile-/runtime approach: At compile time, we first determine the set of all schedule candidates, each latency-optimal for a different scanning order of the loop nest. Then we devise an exact parameterized formula for determining the latency of the resulting symbolic schedules, thus making each schedule fully predictable. At runtime, once the size of the processor array becomes known, a simple prolog selects the overall latency-optimal schedule that is then dynamically activated and executed on the processor array. Hence, our approach avoids any further runtime optimization and expensive re-compilations while achieving the same results as computing an optimal static schedule for each possible combination of array and problem size.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128518736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A high performance systolic architecture for k-NN classification","authors":"Kevin Townsend, Phillip H. Jones, Joseph Zambreno","doi":"10.1109/MEMCOD.2014.6961862","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961862","url":null,"abstract":"This paper describes the architecture of the winning entry to the 2014 Memocode Design Contest, in the maximum performance category. This year's Memocode design contest asks contestants to find the 10 nearest neighbors between 1,000 testing points and 10,000,000 training points. Instead of using Euclidean distance, the contest uses Mahalanobis distance. The contest has 2 awards: the maximum performance award and the cost adjusted performance award. Our implementation uses a brute force approach that calculates the distance between every testing point to every training point. We use the Convey HC-2ex, a FPGA-based platform. However, the theory applies to software implementations as well. At the time of publication, our runtime is 0.54 seconds.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131872096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
P. Nuzzo, Antonio Iannopollo, S. Tripakis, A. Sangiovanni-Vincentelli
{"title":"Are interface theories equivalent to contract theories?","authors":"P. Nuzzo, Antonio Iannopollo, S. Tripakis, A. Sangiovanni-Vincentelli","doi":"10.1109/MEMCOD.2014.6961848","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961848","url":null,"abstract":"Contract-based design is emerging as a unifying compositional paradigm for the specification, design and verification of large-scale complex systems. Different contract frameworks are currently available, but we lack a clear understanding of the relations between them. In this paper, we investigate the relation between interface theories (specifically, relational interfaces) and assume-guarantee (A/G) contracts. We introduce a natural transformation of interfaces to A/G contracts represented by linear temporal logic. Then, we analyze differences and correspondences between key operators and relations in the two theories (i.e. composition, refinement and conjunction), by studying their preservation properties under the proposed transformation. We show that the transformation preserves refinement, but does not generally preserve serial composition and conjunction. Then, we present an assumption-projection operator to make it possible to preserve serial composition and compatibility checking. Finally, we provide illustrative examples that shed light on the effectiveness of both frameworks for requirement formalization, early detection of integration errors, and use of abstraction-refinement.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121431980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Structure-aware CNF obfuscation for privacy-preserving SAT solving","authors":"Ying Qin, ShengYu Shen, Yan Jia","doi":"10.1109/MEMCOD.2014.6961846","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961846","url":null,"abstract":"In this paper, we study the problem of solving hard propositional satisfiability problem in Cloud or computing grid, which is honest-but-curious. We propose an approach to preserve input and output privacy based on CNF obfuscation, and present obfuscation algorithm and its corresponding solution recovery algorithm. By obfuscation, the CNF formula is transformed into another formula, with different circuit structure and over-approximated solution space. Solution of the original CNF can be extracted from the solution of obfuscated CNF by solution recovery. Theoretical analysis demonstrates that, obfuscation algorithm can significantly change the structure of CNF formula with polynomial time complexity, while solution recovery algorithm can filter out solution with linear time complexity. Experimental results on ISCAS89 benchmark show that obfuscation incurs acceptable negative impact on the performance of SAT solving.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"450 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120884330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ayoub Nouri, M. Bozga, A. Molnos, Axel Legay, S. Bensalem
{"title":"Building faithful high-level models and performance evaluation of manycore embedded systems","authors":"Ayoub Nouri, M. Bozga, A. Molnos, Axel Legay, S. Bensalem","doi":"10.1109/MEMCOD.2014.6961864","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961864","url":null,"abstract":"Performance and functional correctness are key for successful design of modern embedded systems. Both aspects must be considered early in the design process to enable founded decision making towards final implementation. Nonetheless, building abstract system-level models that faithfully capture performance information along to functional behavior is a challenging task. In contrast to functional aspects, performance details are rarely available during early design phases and no clear method is known to characterize them. Moreover, once such system-level models are built they are inherently complex as they usually mix software models, hardware architecture constraints and environment abstractions. Their analysis by using traditional performance evaluation methods is reaching the limits and the need for more scalable and accurate techniques is becoming urgent. In this paper, we introduce a systematic method for building stochastic abstract performance models using statistical inference and model calibration and we propose statistical model checking as performance evaluation technique upon the obtained models. We experimented our method on a real-life case study and we were able to verify different timing properties.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"31 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120906931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"MEMOCODE 2014 design contest: k-Nearest Neighbors with Mahalanobis distance metric","authors":"Peter Milder","doi":"10.1109/MEMCOD.2014.6961861","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961861","url":null,"abstract":"The MEMOCODE 2014 hardware/software codesign contest problem is k-Nearest Neighbor search using the Mahalanobis distance metric. Given a data set of points in multi-dimensional space, the goal is to find the k points that are nearest to any given point in that space (quantified with the given distance metric). Contestants were given one month to develop a system to perform the kNN search, aiming to maximize performance or cost-adjusted performance. The two winning teams, which have been invited to contribute papers describing their techniques, combined algorithmic and implementation optimizations. The pure-performance winners targeted the Convey HC-2ex hybrid FPGA/multicore system, while the winners for cost-adjusted performance targeted an Intel multicore.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127604715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"TESL: A language for reconciling heterogeneous execution traces","authors":"Frédéric Boulanger, Christophe Jacquet, Cécile Hardebolle, Iuliana Prodan","doi":"10.1109/MEMCOD.2014.6961849","DOIUrl":"https://doi.org/10.1109/MEMCOD.2014.6961849","url":null,"abstract":"Various formalisms deal with time, and each of them has its own notion of time. When designing a system, it is often desirable to combine several of these formalisms to model different parts. Therefore one has to reconcile execution traces that may use different kinds of time (discrete, continuous, periodic) and different time scales (e.g. minutes, microseconds or even angles in degrees). In this article, we present a deterministic model of time which allows the specification of the coincidence of events that occur on different time scales, as well as instantaneous causality between events. This model supports both event-driven and time-driven specifications.","PeriodicalId":195342,"journal":{"name":"2014 Twelfth ACM/IEEE Conference on Formal Methods and Models for Codesign (MEMOCODE)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122080516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}