{"title":"An Algebraic Petri Nets Emulator","authors":"L. Capra","doi":"10.1109/SYNASC.2015.19","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.19","url":null,"abstract":"Petri Nets (PN) are a consolidated formal model for distributed systems. Classical PNs however are inadequate to model structural changes in systems' lifecycle. Many different attempts to face this issue have lead to lot of PN extensions, of particular concern are those matching the so called \"nets within nets\" paradigm. We present an alternative to this paradigm rigorously based on classical SP EC-inscribed nets, which have a sound algebraic initial semantics. Even if inspired by the same principles, and sharing most of the goals, our approach builds on a uniform framework and permits consolidated techniques to be exploited. The OBJ language is used to inscribe nets.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"91 1","pages":"61-65"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85848393","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":"Stock Market Trading Strategies Applying Risk and Decision Analysis Models for Detecting Financial Turbulence","authors":"M. Tirea, V. Negru","doi":"10.1109/SYNASC.2015.42","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.42","url":null,"abstract":"Risk handling and evaluation plays an importantrole in optimizing an investment portfolio. This paper's goal isto describe a system that determines, classifies and handles riskassociated to any type of investment based on sentiment analysis, price movement, information related to companies, certain characteristics, the traders confidence level, and by measuring thepotential loss over a certain period of time. This research impliesanalyzing trader's risk, market risk, risk associated to eachevaluated company or financial group, political and governmentalrisk. The system is able to create different types of portfoliooptions based on the investor/trader profile, which is build basedon the user's tolerance to risk (determined by the results froman interactive quiz that the user must complete when entering thesystem). We propose a multi-agent system that uses different typeof data(numerical, textual) in order to choose the appropriate mixof investments in order to minimize the risk and maximize thegain on a stock portfolio. In order to validate the result a systemwas constructed.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"1970 1","pages":"216-223"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87390575","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":"vanHelsing: A Fast Proof Checker for Debuggable Compiler Verification","authors":"Roland Lezuo, I. Drăgan, G. Barany, A. Krall","doi":"10.1109/SYNASC.2015.34","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.34","url":null,"abstract":"In this paper we present vanHelsing, a fully automatic proof checker for a subset of first-order problemstailored to a class of problems that arise in compiler verification.vanHelsing accepts input problems formulated in a subset of theTPTP language and is optimized to efficiently solve expressionequivalence problems formulated in first-order logic. Being apractical tool vanHelsing provides also graphical debugging helpwhich makes the visualization of problems and localization offailed proofs much easier. The experimental evaluation showedthat this specialized tool performs up to a factor of 3 better thanstate of the art theorem provers.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"85 1","pages":"167-174"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88691381","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":"An Energy Efficient Intelligent Wireless Body Area Network for Real-Time Vital Signs Monitoring","authors":"Todor Ivascu","doi":"10.1109/SYNASC.2015.50","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.50","url":null,"abstract":"In this paper we present a real-time, continuous vital signs monitoring system based on a Multi-agent architecture. Real-time remote monitoring of the patient's vital signs and generating alerts in case of emergency situations is of great importance in healthcare. Several tiny sensors attached to the patient's body can collect physiological measurements of vital signs, and transmit them to a remote server, from where it can be consulted by a physician. Using Wireless Body Area Networks (WBANs) technology patients can move freely and perform daily tasks while being monitored. In such systems energy is the most valuable resource. Most energy consumption is done by data transmission related operations. Therefore local processing of vital signs measurements and continuously updating vital signs thresholds according to the activity carried by the patient on each sensor node, and sending data only when abnormal values exceed these ranges, can significantly reduce data transmission and save the sensors' battery life.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"23 1","pages":"265-270"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89349476","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":"Scalable and Fault Tolerant Monitoring of Security Parameters in the Cloud","authors":"Bogdan Irimie, D. Petcu","doi":"10.1109/SYNASC.2015.53","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.53","url":null,"abstract":"Monitoring cloud resources is an essential part of cloud computing, and although some effort has been made in this direction, monitoring security parameters is still an open issue because of the large number and types of resources available in a multi tenant environment. In this paper we propose a distributed monitoring system that is able to monitor, filter and store security parameters of network hosts. The proposed system is decentralized, fault tolerant and can run scanning jobs in parallel, those three characteristics making it a perfect candidate for monitoring resources in a cloud environment. The proposed monitoring system was validated by a series of tests that demonstrated it's scalability. All the empirical results were analysed and conclusions were formulated based on the observed properties.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"13 1","pages":"289-295"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80933206","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":"Improving Malware Detection Response Time with Behavior-Based Statistical Analysis Techniques","authors":"Dumitru-Bogdan Prelipcean, Adrian-Stefan Popescu, Dragos Gavrilut","doi":"10.1109/SYNASC.2015.44","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.44","url":null,"abstract":"Detection of malicious software is a current problem which can be solved via several approaches. Among these are signature based detection, heuristic detection and behavioral analysis. In the last year the number of malicious files has increased exponentially. At the same time, automated obfuscation methods (used to generate malicious files with similar behavior but different aspect) have grown significantly. In response to these new obfuscation methods, many security vendors have introduced file reputation techniques to quickly find out potentially clean and malicious samples. In this paper we present a statistical based method that can be used to identify a specific dynamic behavior of a program. The main idea behind this solution is to analyze the execution flow of every file and to extract sequences of native system functions with a potential malign outcome. This technique is reliable against most forms of malware polymorphism and is intended to work as a filtering system for different automated detection systems. We use a database consisting of approximately 50.000 malicious files gathered over the last three months and almost 3.000.000 clean files collected for a period of 3 years. Our technique proved to be an effective filtering method and helped us improve our detection response time against the most prevalent malware families discovered in the last year.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"63 1","pages":"232-239"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73521724","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":"Algorithmic Logic-Based Verification with SeaHorn","authors":"A. Gurfinkel","doi":"10.1109/SYNASC.2015.10","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.10","url":null,"abstract":"In this tutorial, I will present SeaHorn, a software verification framework. The key distinguishing feature of SeaHorn is its modular design that separates the concerns of the syntax of the programming language, its operational semantics, and the verification semantics. SeaHorn encompasses several novelties: it (a) encodes verification conditions using an efficient yet precise inter-procedural technique, (b) provides flexibility in the verification semantics to allow different levels of precision, (c) leverages the state-of-the-art in software model checking and abstract interpretation for verification, and (d) uses Horn-clauses as an intermediate language to represent verification conditions which simplifies interfacing with multiple verification tools based on Horn-clauses. SeaHorn provides users with a powerful verification tool and provides researchers with an extensible and customizable framework for experimenting with new software verification techniques.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"97 1","pages":"12-15"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76608260","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":"Properties of Multisets Compared to Sets","authors":"Aurelian Radoaca","doi":"10.1109/SYNASC.2015.37","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.37","url":null,"abstract":"We present some properties of multisets comparedto sets, regarding the relations and operations between multisets, in an attempt to simplify the analysis of multisets. We introducemixed operations between sets and multisets and analyze thedressed epsilon (membership) symbol, which gives additionalinformation to the multiplicity of elements in a multiset.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"41 1","pages":"187-188"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75439330","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":"From Decision Procedures to Synthesis Procedures","authors":"R. Piskac","doi":"10.1109/SYNASC.2015.78","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.78","url":null,"abstract":"Software synthesis is a technique for automatically generating code from a given specification. The goal of software synthesis is to make software development easier while increasing both the productivity of the programmer and the correctness of the produced code. In this paper we present an approach to synthesis that relies on the use of automated reasoning and decision procedures. First we describe how to generalize decision procedures into predictable and complete synthesis procedures.Here completeness means that the procedure is guaranteed to find code that satisfies the given specification. We illustrate the process of turning a decision procedure into a synthesis procedure using linear integer arithmetic as an example.However, writing a complete specification can be a tedious task,sometimes even harder than writing the code itself. To over come this problem, ideally the user could provide a few input-output examples, and then the code should be automatically derived.We outline how to broaden usability and applications of current software synthesis techniques. We conclude with an outlook on possible future research directions and applications of synthesis procedures.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"91 1","pages":"3-10"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80397489","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":"Complex Network Analysis of a Tourism Content Sharing Network","authors":"A. Becheru, C. Bǎdicǎ, Mihaita Antonie","doi":"10.1109/SYNASC.2015.67","DOIUrl":"https://doi.org/10.1109/SYNASC.2015.67","url":null,"abstract":"This paper presents results of the analysis of a tourism information Web-site (AmFostAcolo.ro) by using Complex Networks (CN) methods. The work accomplished here complements a previous paper, where we discussed data extraction and modelling into a complex network. Properties of the resulted network, communities and vertices are looked upon, in order to extract useful information and detect social phenomena. Temporal analysis methods are employed for examining the evolution of the web-site. The results obtained prove the natural development of the Web-site and the usefulness of CN analysis methods in this scenario.","PeriodicalId":6488,"journal":{"name":"2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"50 1 1","pages":"407-414"},"PeriodicalIF":0.0,"publicationDate":"2015-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90070968","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}